10202
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15306
- Proper Divisor Sum (Aliquot Sum)
- 5104
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5100
- Möbius Function
- 1
- Radical
- 10202
- 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
- 86
- 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
- yes
- Odd
- no
Appears in sequences
- Primes in ternary.at n=25A001363
- a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)).at n=23A005468
- a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)) for n > 1, a(1) = 3.at n=7A005510
- a(1) = 3; for n>=1, a(n+1) = a(n) converted to base 10 from base 3 (written in base 10).at n=3A023372
- In the list of divisors of n (in base 3), each digit 0-2 appears equally often.at n=2A045811
- a(n) * a(n)_reversed is a palindrome (and a(n) is not palindromic).at n=37A048344
- Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order.at n=19A058944
- Numbers n such that sum of digits = number of digits.at n=38A061384
- a(1) = 3, a(n) = a(n-1)^2 + 1.at n=3A062013
- Coefficients of irreducible polynomials over GF(3) listed in lexicographic order.at n=22A065020
- a(n) = prime(n)^2 + 1.at n=25A066872
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={0,2}.at n=14A079993
- Another lazy binary representation of n: similar to A089591 except that the single carry is performed before the increment instead of after.at n=26A089600
- Poincaré series [or Poincare series] (or Molien series) for a certain five-fold wreath product P_5.at n=39A091726
- a(n) = 101 written in base n.at n=2A095592
- a(n) = 101 written in base 12 - n.at n=9A095593
- Number of partitions of n such that the size of the tail below the Durfee square is equal to the size of the tail to the right of the Durfee square.at n=54A114424
- Number of 10-almost primes k such that 2^n < k <= 2^(n+1).at n=21A120041
- a(n) = ceiling( Sum_{i=1..n-1} a(i)/5 ), a(1)=1.at n=54A120170
- a(n) = prime(n)_prime(n).at n=25A122622