12507
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18240
- Proper Divisor Sum (Aliquot Sum)
- 5733
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7560
- Möbius Function
- -1
- Radical
- 12507
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 112
- 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 nodes in regular n-gon with all diagonals drawn.at n=25A007569
- a(n) = n*(23*n - 1)/2.at n=33A022280
- Number of partitions of n into parts not of the form 21k, 21k+5 or 21k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=36A035983
- Denominators of continued fraction convergents to sqrt(523).at n=10A042001
- Base-7 palindromes that start with 5.at n=26A043019
- Numbers having four 3's in base 8.at n=3A043436
- Indices of pentagonal numbers which are also octagonal.at n=3A046187
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=25A047826
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UUU's (triple rises) where U=(1,1). Rows have 1,1,1,2,3,4,5,... entries, respectively.at n=50A092107
- Number of partitions of n into 5-smooth parts.at n=37A112581
- a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + a(n-4) with n>3, a(0)=1, a(1)=2, a(2)=3, a(3)=7.at n=17A131300
- a(n) = 338*n + 1.at n=36A158000
- a(n) = 74*n^2 + 1.at n=13A158742
- a(n) = 9*n^2 - 13*n + 5.at n=37A214675
- Number of partitions of n such that (greatest part) + (least part) = number of parts.at n=51A237869
- Sum of the squares of numbers of nonconsecutive chess tableaux over all partitions of n.at n=14A238184
- Numbers n such that n^10+10 is prime.at n=19A239347
- Number of partitions p of n such that (number of numbers of the form 5k + 2 in p) is a part of p.at n=36A241551
- Numbers k such that prime(k) + 1, ..., prime(k + 5) + 1 have the same number of prime divisors (with multiplicity).at n=3A255193
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 129", based on the 5-celled von Neumann neighborhood.at n=28A270219