10210
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
- 8
- Divisor Sum
- 18396
- Proper Divisor Sum (Aliquot Sum)
- 8186
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4080
- Möbius Function
- -1
- Radical
- 10210
- 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
- 60
- 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
- a(1)=1, a(n) = 21*a(n-1) + n.at n=3A014905
- Least m such that if r and s in {1/3, 1/6, 1/9, ..., 1/3n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=44A024838
- Positive numbers having the same set of digits in base 3 and base 10.at n=39A037422
- Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 1,0,2.at n=4A037503
- Numbers whose sum of digits is 4.at n=43A052218
- a(n) = 6*n^2 + 3*n + 1.at n=41A085473
- a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k.at n=12A089493
- "Lazy binary" representation of n. Also called redundant binary representation of n.at n=26A089591
- Square array, read by antidiagonals, where column (k+1) equals the self-convolution of row k, with row 0 and column 0 consisting of all 1's.at n=58A093541
- a(n) = 102 written in base n.at n=2A095594
- a(n) = 102 written in base 12 - n.at n=9A095595
- 10 times A007623.at n=29A124252
- Take the base-3 representation of n, render that in decimal notation and take the base-3 representation of n again.at n=11A126135
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10^3.at n=14A127028
- Number of graphs on n labeled nodes with maximal degree exactly 3.at n=5A136285
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 3 and 4.at n=60A136810
- Numbers k such that k and k^2 use only the digits 0, 1, 2 and 4.at n=47A136816
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 4 and 7.at n=50A136819
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 4 and 9.at n=62A136821
- Expansion of Product_{k>=1} (1 + x^k*A005185(k)).at n=24A147879