10669
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10944
- Proper Divisor Sum (Aliquot Sum)
- 275
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10396
- Möbius Function
- 1
- Radical
- 10669
- 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
- 47
- Smith Number
- yes
- 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
- Numbers k such that k*4^k + 1 is prime.at n=11A007646
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=44A024842
- [ exp(3/4)*n! ].at n=6A030974
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 76 ones.at n=3A031844
- Least inverse of A015910: smallest integer k > 0 such that 2^k mod k = n, or 0 if no such k exists.at n=6A036236
- Least positive number k such that 2^k mod k = 2n, or 0 if no such k exists.at n=3A122182
- Numbers m such that 2^m == 6 (mod m).at n=2A128122
- a(n) = 6*n^2 - 10*n + 5.at n=42A136392
- Record values in A046641.at n=31A145771
- a(n) = 29 + 73*n + 37*n^2.at n=16A145980
- Semiprimes p*q such that 2^p mod q == 2^q mod p.at n=45A179707
- Semiprimes p*q with p < q and 2^p (mod q) == 2^q (mod p).at n=18A179839
- Number of (n+1) X 3 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=36A206261
- Indices of record values in A216476.at n=21A216502
- Numbers n such that the digit sum of Fibonacci(n) is equal to the digit sum of Lucas(n).at n=32A244923
- a(n) = (2n-2)^3 + (2n-2) - 1.at n=11A255877
- a(n) = 24*n^2 + 52*n + 29.at n=20A258721
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 243", based on the 5-celled von Neumann neighborhood.at n=24A271002
- Positions of ones in A264977; positions of twos in A277330.at n=60A277701
- Number of parts in all partitions of n with largest multiplicity nine.at n=27A320379