12497
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12498
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12496
- Möbius Function
- -1
- Radical
- 12497
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 156
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1492
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) is the n-th diagonal sum of left justified array T given by A027960.at n=29A027975
- Sum of first n terms of A_n (using absolute values of terms).at n=16A039928
- First differences are A005563.at n=32A047732
- Primes p from A031924 such that A052180(primepi(p)) = 29.at n=9A052236
- Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives first row of array.at n=10A057153
- a(n) = smallest k such that 4k has a digit sum = n.at n=37A077490
- Records in A079378.at n=9A079379
- Sum of first n terms of A_n (signed values).at n=16A100543
- Index k of the least colossally abundant number c=A004490(k) with sigma(c)/c >= n.at n=19A110443
- Primes of the form x^y + y^z + z^x, for x,y,z > 1.at n=8A123207
- Primes congruent to 28 mod 37.at n=35A142137
- Primes congruent to 33 mod 41.at n=37A142230
- Primes congruent to 27 mod 43.at n=35A142276
- Primes congruent to 42 mod 47.at n=29A142393
- Primes congruent to 2 mod 49.at n=39A142415
- Primes congruent to 42 mod 53.at n=28A142572
- Primes congruent to 12 mod 55.at n=38A142609
- Primes congruent to 48 mod 59.at n=28A142775
- Primes congruent to 53 mod 61.at n=23A142851
- Primes congruent to 23 mod 63.at n=41A142902