10120
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 15800
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3520
- Möbius Function
- 0
- Radical
- 2530
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 42
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = floor(n*(n-1)*(n-2)/9).at n=46A011891
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/21).at n=23A011931
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/30).at n=25A011940
- Positive numbers k such that k and 2*k are anagrams of each other in base 3 (k is written here in base 3).at n=2A023058
- Numbers whose base-10 representation has exactly 5 runs.at n=9A043641
- Numbers whose sum of digits is 4.at n=41A052218
- a(n) = Sum_{d|4} phi(d)*n^(4/d).at n=10A054603
- a(n) = Sum_{d|n} phi(d)*10^(n/d).at n=4A054617
- Multiples of 4 whose digits add to 4.at n=13A063997
- Duplicate of A063997.at n=13A069539
- a(1) = 1, a(n) is the smallest multiple of n which is obtained by inserting/prefixing or suffixing at least one digit in a(n-1).at n=4A078283
- a(1) = 1, a(n) = smallest multiple of n that can be obtained by inserting digits anywhere in a(n-1) if necessary.at n=4A080502
- "Lazy binary" representation of n. Also called redundant binary representation of n.at n=24A089591
- Index of first occurrence of n in A091853, or 0 if no such number exists.at n=22A091854
- a(n) = 96 written in base n.at n=2A095584
- a(n) = 96 written in base 13 - n.at n=10A095585
- Denominator of sum of reciprocals of first n 5-simplex numbers A000389.at n=20A118432
- Triangle T, read by rows, where column k equals column k of T^(k+1) shift down 1 row, with T(n,n)=T(n+1,n)=1 for n>=0.at n=48A121391
- Column 3 of triangle A121391, where column k of T=A121391 equals column k of T^(k+1) shift down 1 row.at n=6A121394
- Numbers k such that k^2 divides 9^k - 1.at n=31A127101