12097
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12098
- 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
- 12096
- Möbius Function
- -1
- Radical
- 12097
- 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
- 68
- 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
- 1447
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Cuban primes: primes which are the difference of two consecutive cubes.at n=30A002407
- Primes that remain prime through 3 iterations of function f(x) = 2x + 3.at n=23A023273
- Primes that remain prime through 4 iterations of function f(x) = 2x + 3.at n=10A023303
- Primes that remain prime through 5 iterations of function f(x) = 2x + 3.at n=4A023331
- Primes of form k^2 - 3.at n=19A028874
- Numbers n such that n and n-1 are differences between 2 positive cubes in at least one way.at n=13A038595
- Gaps of 6 in sequence A038593 (lower terms).at n=4A038651
- Primes prime(k) for which A049076(k) = 3.at n=34A049079
- Numbers n such that n and n+4^k are all primes for k=1,2,3.at n=28A049493
- 7th-order Fibonacci numbers with a(0)=...=a(6)=1.at n=18A060455
- Primes p such that the greatest prime divisor of p-1 is 7.at n=44A061638
- Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.at n=1A063061
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6, 2]; short d-string notation of pattern = [462].at n=21A078851
- Primes p such that the differences between the 5 consecutive primes starting with p are (4,6,2,4).at n=2A078954
- Primes of the form (prime(k-1)+1)*(prime(k+1)-1) + 1, k>1.at n=8A087106
- Primes of the form 6*p - 5 such that p and 6*p - 1 are primes.at n=43A090607
- a(n)*a(n-5) = a(n-1)*a(n-4)+a(n-2)+a(n-3), with initial terms a(1) = ... = a(5) = 1.at n=16A092264
- Smallest number m such that A102442(m)=n.at n=10A102444
- Primes equal to the product of two successive sexy primes plus 6.at n=10A104229
- Primes of the form 128n+65.at n=25A105129