10142
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16632
- Proper Divisor Sum (Aliquot Sum)
- 6490
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4600
- Möbius Function
- -1
- Radical
- 10142
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 86
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- -1 + number of partitions of n.at n=33A000065
- a(n) = a(n-1) + a(n-1-(number of odd terms so far)).at n=34A007604
- a(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=26A010005
- Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 2,1,3.at n=6A037632
- Numbers whose base-10 representation has exactly 5 runs.at n=29A043641
- Same rule as Aitken triangle (A011971) except a(0,0)=0, a(1,0)=1.at n=43A046936
- Number of starting positions of Nim with 2n pieces such that 2nd player wins. Partitions of 2n such that xor-sum of partitions is 0.at n=23A048833
- Numbers k such that 265*2^k + 1 is prime.at n=20A053349
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 5) so far).at n=27A060732
- Total sum of even parts in all partitions of n.at n=21A066966
- Numbers k such that phi(k) + phi(k+1) = k+2.at n=19A067797
- Number of (nontrivial) zeros of zeta(z) with 0 < Im(z) < 10^n.at n=3A072080
- a(n) = A083964(n)/(2n-1).at n=23A083965
- p such that p^4 + q^4 = r^4 + s^4 = a(n).at n=33A088728
- a(n) = (5/6)*n^3+(5/2)*n^2+(8/3)*n.at n=22A092185
- a(n) = n^3 - n^2 - n.at n=22A152015
- a(n) = 441*n - 1.at n=22A158319
- Number of triples (w,x,y) with all terms in {0,...,n} and |w-x| + |x-y| <= w+x+y.at n=21A213481
- Number of tilings of a 4 X n rectangle using integer-sided rectangular tiles of area 4.at n=14A220123
- Number T(n,k) of isoscent sequences of length n with exactly k descents; triangle T(n,k), n>=0, 0<=k<=n+2-ceiling(2*sqrt(n+1)), read by rows.at n=24A242352