11983
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12528
- Proper Divisor Sum (Aliquot Sum)
- 545
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11440
- Möbius Function
- 1
- Radical
- 11983
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 94
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of cubic bicolored graphs on n unlabeled nodes admitting an automorphism exchanging the colors.at n=12A000840
- a(n) = floor(n*phi^13), where phi is the golden ratio, A001622.at n=23A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=23A004948
- Composite numbers not divisible by 5 which in base 5 contain their largest proper factor as a substring.at n=5A063889
- Total sum of parts of multiplicity 2 in all partitions of n.at n=29A117525
- a(n) = A000265(3*(a(n-1) + a(n-2))/2 + 1) starting at a(1)=1, a(2)=11.at n=24A124139
- Row 4 of table A162424.at n=22A162427
- a(n) = Sum_{j=1..prime(n)-1} floor(j^2/prime(n)).at n=42A165993
- Number of strings of numbers x(i=1..6) in 0..n with sum i^2*x(i)^2 equal to n^2*36.at n=30A184244
- n for which A079277(n) + phi(n) < n.at n=13A208815
- Number of (n+2) X (3+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=8A252956
- Composites c for which an integer 1 < k < c exists such that (c-k)! == -1 (mod c).at n=29A256519
- Number of n X 3 0..2 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=5A279867
- Number of nX6 0..2 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=2A279870
- T(n,k)=Number of nXk 0..2 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=30A279871
- T(n,k)=Number of nXk 0..2 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=33A279871
- a(n) = a(n-1) + a(n-2) + a([n/2]), where a(0) = 1, a(1) = 2, a(2) = 3.at n=17A298339
- Sum of the squarefree parts of the partitions of n into 4 parts.at n=40A309479
- a(n) is the smallest k such that k!'s prime(n)-smooth part is less than its prime(n+1)-rough part.at n=26A360316