12001
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
- 4
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 1103
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10900
- Möbius Function
- 1
- Radical
- 12001
- 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
- 143
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (n^3 + 2*n)/3.at n=33A006527
- Pseudoprimes to base 79.at n=42A020207
- Strong pseudoprimes to base 79.at n=14A020305
- Strong pseudoprimes to base 93.at n=17A020319
- a(n) = (2*n+1)*(4*n^2+4*n+3)/3.at n=16A057813
- Variant of the factorial base representation of n.at n=36A072001
- Numbers in base -3.at n=28A073785
- Greater of number pair whose squares are reversals of each other, with no leading zeros allowed.at n=32A106324
- Numbers k such that k and k^2 use only the digits 0, 1, 2 and 4.at n=55A136816
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, -1), (1, 0, 1), (1, 1, -1)}.at n=8A149228
- a(n) = 400 * n + 1.at n=29A158313
- a(n) = 30*n^2 + 1.at n=20A158558
- a(n) = 13*n^2 + 10*n + 1.at n=30A161587
- a(n) = n*(2*n^2 + 5*n + 13)/2.at n=22A163655
- Number of ways to partition a 2*n X 2 grid into 4 connected equal-area regions.at n=32A167238
- One third of product plus sum of three consecutive nonnegative integers; a(n)=(n+1)(n^2+2n+3)/3.at n=32A167875
- Numbers n such that sum of squares of factorials of digits of n is a power of 2.at n=39A174570
- a(n) = n*(n+1)*(2*n+1)/6 - n*floor(n/2).at n=32A178946
- Centered 40-gonal numbers.at n=24A195317
- Nonprime numbers with all divisors starting and ending with digit 1.at n=12A208261