12467
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15456
- Proper Divisor Sum (Aliquot Sum)
- 2989
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9792
- Möbius Function
- -1
- Radical
- 12467
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 63
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of partitions of n with equal number of parts congruent to each of 0, 3 and 4 (mod 5).at n=52A035577
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.at n=19A059828
- (Prime(prime(n))^2-1)/24.at n=24A092772
- Number of Pythagorean triples with hypotenuse < 10^n.at n=3A101929
- Sum of the primes in ordered 3 X 3 prime squares.at n=24A105089
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, a(5) = 8, a(6) = 16, for n>5: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) + a(n-6)], where SORT places digits in ascending order and deletes 0's.at n=34A108567
- Integers arising in A133677.at n=18A133645
- a(n) = 1 + (1200 + (634 + (225 + (85 + (15 + n)*n)*n)*n)*n)*n/720.at n=12A145128
- Positive numbers y such that y^2 is of the form x^2+(x+16807)^2 with integer x.at n=1A156713
- Number of slanted n X 4 (i=1..n) X (j=i..4+i-1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.at n=35A165378
- Partial sums of A049486.at n=26A174655
- Floor of the expected value of number of trials until exactly five cells are empty in a random distribution of n balls in n cells.at n=27A210116
- a(0)=-2, a(1)=3; thereafter a(n) = 2*a(n-1) + a(n-2).at n=11A221172
- Number of n X n 0..2 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=3A224256
- Number of n X 4 0..2 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=3A224258
- T(n,k) = number of n X k 0..2 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=24A224262
- Number of 4 X n 0..2 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=3A224264
- Number of length 6+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=13A248439
- Composite numbers which divide the concatenation of their prime factors, with multiplicity, in descending order.at n=1A248915
- Least positive integer k such that both k and k*n belong to the set {m>0: prime(prime(m))-prime(m)+1 = prime(p) for some prime p}.at n=35A260753