12450
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 31248
- Proper Divisor Sum (Aliquot Sum)
- 18798
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3280
- Möbius Function
- 0
- Radical
- 2490
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 37
- 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 partitions of n into at most 8 parts.at n=42A008637
- Number of partitions of n in which the greatest part is 8.at n=50A026814
- Even 9-gonal (or enneagonal) numbers.at n=30A028992
- Numbers k in which the digits of k^2 appear.at n=22A029774
- Numbers k such that 129*2^k+1 is prime.at n=17A032414
- Expansion of 1 / Product_{k >= 1} (1-q^k)^2*(1-q^(11k))^2.at n=18A032442
- Positive numbers having the same set of digits in base 7 and base 10.at n=34A037440
- Difference between average of smallest prime greater than n^3 and largest prime less than (n+1)^3 and n-th pronic [=n(n+1)].at n=21A063036
- Number of integers not exceeding 2^n that are impossible as sum-of-divisors of other numbers.at n=13A095380
- Triangular matchstick numbers in the class of prime numbers: sum of n-th and next n primes.at n=40A105720
- Enneagonal numbers for which the product of the digits is also an enneagonal number.at n=19A117052
- Numbers whose base-10 and base-7 representations are permutations of the same multiset of digits.at n=23A130604
- Numbers k such that k*Lucas(k) + 1 is prime.at n=27A134696
- Number of nX2 0..2 arrays with no element equal to the average of its horizontal and vertical neighbors.at n=4A197436
- Number of nX5 0..2 arrays with no element equal to the average of its horizontal and vertical neighbors.at n=1A197439
- T(n,k)=Number of nXk 0..2 arrays with no element equal to the average of its horizontal and vertical neighbors.at n=16A197442
- T(n,k)=Number of nXk 0..2 arrays with no element equal to the average of its horizontal and vertical neighbors.at n=19A197442
- Fibonacci + Goldbach: a(1)=6, a(2)=8 and for n>=3, a(n)=g(a(n-1)) + g(a(n-2)), where for m>=3, g(2*m) is the maximal prime p < 2*m such that 2*m - p is prime.at n=21A216275
- Triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists the numbers of A210843 multiplied by A000330(k), and the first element of column k is in row A000217(k).at n=48A249120
- E.g.f.: 2 - exp(2) + Sum_{n>=1} 2^n * exp(3*x^n) / n!.at n=6A258903