12973
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12974
- 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
- 12972
- Möbius Function
- -1
- Radical
- 12973
- 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
- 50
- 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
- 1545
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 49.at n=17A020388
- Primes with multiplicative persistence value 5.at n=27A046505
- Primes p from A031924 such that A052180(primepi(p)) = 19.at n=14A052235
- Primes p such that x^47 = 2 has no solution mod p.at n=35A059257
- Primes with 14 as smallest positive primitive root.at n=10A061327
- Primes in A003154.at n=26A083577
- a(n) = smallest prime == 1 (mod T(n)) where T(n) is the n-th triangular number (A000217).at n=45A087385
- a(n) = 997*n + 1009.at n=12A100776
- Odd winning positions in Fibonacci nim.at n=23A120904
- Centered 47-gonal numbers.at n=23A129428
- a(1)=1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = a(k) + Sum_{j=1..2^m} a(j).at n=36A139485
- Primes congruent to 23 mod 37.at n=42A142132
- Primes congruent to 17 mod 41.at n=39A142214
- Primes congruent to 30 mod 43.at n=38A142279
- Primes congruent to 37 mod 49.at n=35A142445
- Primes congruent to 41 mod 53.at n=29A142571
- Primes congruent to 48 mod 55.at n=35A142635
- Primes congruent to 34 mod 57.at n=39A142686
- Primes congruent to 52 mod 59.at n=28A142779
- Primes congruent to 41 mod 61.at n=24A142839