12016
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 23312
- Proper Divisor Sum (Aliquot Sum)
- 11296
- 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
- 1502
- Omega Function (Ω)
- 5
- 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
- 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
- Number of trees with n nodes and 2-colored internal (non-leaf) nodes.at n=11A004114
- Numbers k such that the continued fraction for sqrt(k) has period 100.at n=30A020439
- Numbers k such that k! - (k-1)! + 1 is prime.at n=20A049432
- Number of partitions into at most a(1) copies of 1, a(2) copies of 2, ...at n=48A052337
- Numbers k such that product of factorials of digits of k equals pi(k) (A000720).at n=4A066457
- Smallest integer >= 0 of the form x^3 - n^4.at n=37A070930
- Numbers k such that 2^k + Fibonacci(k) is prime.at n=19A074824
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k ascents of length 4 (0<=k<=floor(n/4)). Also number of ordered trees with n edges which have k vertices of outdegree 4.at n=18A114508
- Number of Dyck paths of semilength n having no ascents of length 4.at n=10A114509
- Numbers k such that k + sigma(k) + sigma(sigma(k)) is a square.at n=32A116014
- Expansion of (1-x)^4/((1-x)^6 - x^6).at n=15A119336
- Triangle, read by rows, where T(n,k) = T(n,k-1) + n*T(n-1,k-1) for n>0 and k>0, with T(n,0) = T(n-1,n-1) for n>0 and T(0,0) = 1.at n=23A132007
- Has two properties: concatenation of its digits is same string as concatenation of digits of its first differences and every number appears exactly one of the sequence or its first differences.at n=38A139310
- Number of binary strings of length n with equal numbers of 01001 and 10010 substrings.at n=14A164259
- Number of binary strings of length n with no substrings equal to 0010 1001 or 1100.at n=13A164501
- T(n,k) = 4*A046802(n,k) - 2*A008518(n,k) - A007318(n,k), triangle read by rows (0 <= k <= n).at n=38A168291
- T(n,k) = 4*A046802(n,k) - 2*A008518(n,k) - A007318(n,k), triangle read by rows (0 <= k <= n).at n=42A168291
- Reciprocals of the deviation of continued fraction convergents from Pi.at n=2A171245
- Sigma(n)-n values in A085844.at n=16A216383
- a(n) = 2*n^4 - floor(2^(1/4)*n)^4.at n=32A257854