12004
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 21014
- Proper Divisor Sum (Aliquot Sum)
- 9010
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6000
- Möbius Function
- 0
- Radical
- 6002
- 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
- no
- 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
- Expansion of Product_{m>=1} (1 - m*q^m)^4.at n=18A022664
- Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).at n=20A023073
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 58 ones.at n=20A031826
- Numbers whose base-7 representation contains exactly four 6's.at n=4A043420
- Numbers k such that k^6 == 1 (mod 7^4).at n=29A056092
- Let M = the 3 X 3 matrix [ 0 1 0 / 0 0 1 / -1, 3*sqrt(3), 3]. M^n * [1 1 1] = [ p q r]; then a(n-1), a(n), a(n+1) = floor p, q, r, respectively.at n=9A094255
- Irregular triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k white corners.at n=33A140711
- Numbers of the form i*7^j-1 (i=1..6, j >= 0).at n=28A181303
- a(n) = 4*(5*n^2 - 5*n + 1).at n=24A193448
- a(n) = 5*7^n-1.at n=4A198687
- Number of (n+1) X (1+1) 0..2 arrays colored with the maximum plus the lower median minus the minimum of every 2 X 2 subblock.at n=3A236604
- Number of (n+1)X(4+1) 0..2 arrays colored with the maximum plus the lower median minus the minimum of every 2X2 subblock.at n=0A236607
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the lower median minus the minimum of every 2X2 subblock.at n=6A236610
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the lower median minus the minimum of every 2X2 subblock.at n=9A236610
- Number of partitions p of n such that 2(number of parts of p) - min(p) is a part of p.at n=52A238587
- Number of partitions p of n such that median(p) < multiplicity(min(p)).at n=37A240212
- G.f. = b(2)*b(4)*b(6)/(x^8+x^6-x^5-x^3-x+1), where b(k) = (1-x^k)/(1-x).at n=19A266333