10012
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
- 6
- Divisor Sum
- 17528
- Proper Divisor Sum (Aliquot Sum)
- 7516
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5004
- Möbius Function
- 0
- Radical
- 5006
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 65
- 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
- Generalized tangent numbers d_(n,2).at n=13A000176
- Numbers written in base of triangular numbers.at n=19A000462
- n written in base where place values are positive squares.at n=30A007961
- 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=1A023058
- Number of monomer-dimer tilings of n X n chessboard.at n=4A028420
- Number of matchings in graph P_{4} X P_{n}.at n=4A033507
- Number of matchings in graph P_{4} X P_{4} X P_{n}.at n=1A033533
- Lexicographically earliest strictly increasing base 3 autovarious sequence: a(n) = number of distinct a(k) mod 3^n (written in base 3).at n=13A037091
- Positive numbers having the same set of digits in base 3 and base 10.at n=32A037422
- Lexicographically earliest strictly increasing base 4 autovarious sequence: a(n) = number of distinct a(k) mod 4^n (written in base 4).at n=12A038113
- a(n) is smallest difference d of an arithmetic progression dk+1 whose first prime occurs at the n-th position.at n=24A047980
- a(n) = A047980(2n+1).at n=12A047982
- a(n) * a(n)_reversed is a palindrome (and a(n) is not palindromic).at n=30A048344
- Numbers whose sum of digits is 4.at n=36A052218
- Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.at n=23A055481
- Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order.at n=14A058944
- Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order.at n=7A058949
- Numbers n such that n*R(n) is a palindrome, where R(n) (A004086) = digit reversal.at n=44A062936
- a(1) = 1; a(n+1) = a(n) + product of nonzero digits of a(n) when written in base 3. Display sequence in base 3.at n=37A063112
- Multiples of 4 whose digits add to 4.at n=12A063997