12151
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12600
- Proper Divisor Sum (Aliquot Sum)
- 449
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11704
- Möbius Function
- 1
- Radical
- 12151
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 63
- 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
- Number of bipartite partitions of n white objects and 4 black ones.at n=15A000465
- Positive numbers for which the sum of digits equals the product of digits.at n=40A034710
- Numerators of continued fraction convergents to sqrt(93).at n=9A041166
- Numerators of continued fraction convergents to sqrt(372).at n=5A041704
- Numerators of continued fraction convergents to sqrt(837).at n=5A042616
- Integers m such that (x1*x2*..xk)^(x1+x2+..xk) = (x1+x2+..xk)^(x1*x2*..xk) where x1x2..xk are the digits of m in base 10.at n=43A064158
- Nonprimes whose sum of digits is equal to its product of digits.at n=32A066307
- Nonprime numbers k such that (k+1)*Sum_{d|k} 1/(d+1) is an integer.at n=13A069155
- Duplicate of A069155.at n=13A074977
- a(n) is smallest natural number a satisfying Pell equation a^2 - d(n)*b^2= +1 or = -1, with d(n)=A000037(n) (a nonsquare). Corresponding smallest b(n)=A077233(n).at n=83A077232
- a(n)=5a(n-2)+2a(n-3).at n=12A112685
- Semiprimes for which both the sum and the product of the digits is also a semiprime.at n=35A118690
- a(n) = 4*n^3 - 6*n^2 + 1.at n=15A141530
- a(n) = (n+3)^2*n/2 + 1.at n=27A154560
- a(n) = 392*n - 1.at n=30A158004
- a(n) = 54*n^2 + 1.at n=15A158646
- a(n) = 62*n^2 - 1.at n=13A158680
- a(1)=4. a(n) = a(n-1) + n, if a(n-1)+n is composite. Otherwise a(n) = a(n-1)*n.at n=27A175459
- a(n) is the least number such that k = n*a(n) has sum of digits n and ends with the digit string n, or 0 if no such number exists.at n=31A175690
- Starting with 1, smallest integer not yet in the sequence such that two neighboring digits of the sequence multiply to a prime.at n=38A182271