12853
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12854
- 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
- 12852
- Möbius Function
- -1
- Radical
- 12853
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 24
- 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
- 1532
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of (s(0), s(1), ..., s(n)) such that s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 3; also a(n) = T(n,n-3), where T is the array defined in A026082.at n=8A026086
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 74 ones.at n=10A031842
- Lower prime of the second gap of 2n between primes.at n=17A046789
- Primes base 10 that remain primes in five bases b, 2<=b<=10, expansions interpreted as decimal numbers.at n=39A052029
- a(1) = 2; a(n) is smallest prime > 2*a(n-1).at n=12A055496
- Smallest prime p of two consecutive primes, p < q, such that gcd( p-1, q-1 ) = 2n.at n=17A058264
- Primes p such that x^27 = 2 has no solution mod p, but x^9 = 2 has a solution mod p.at n=2A059354
- Primes p such that x^9 = 2 has a solution mod p, but x^(9^2) = 2 has no solution mod p.at n=3A070185
- Primes for which the four closest primes are smaller.at n=26A075030
- a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in nondescending order.at n=6A075046
- a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in nondescending order.at n=7A075046
- Values of A028470(n)/A000045(n+1).at n=5A078757
- a(n) is the smallest prime p of the form 4k+1 such that nextprime(p) - p = 4n.at n=8A082099
- Primes p such that (r-p)/log(p) > 3, where r is the next prime after p.at n=34A082888
- Beginning with 2, least new prime such that the concatenation a(n), a(n-1), ...a(2), a(1), a(2), ...a(n) is prime.at n=51A090564
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 11.at n=4A109565
- Numbers k such that k, k+1, k+2 and k+3 are 1,2,3,4-almost primes.at n=13A113000
- a(n+1) = 4*a(n) + 11*a(n-1) - 2*a(n-2).at n=5A122885
- Interlaced merger of A122883, A122884 and A122885.at n=20A122886
- Primes of the form p^3 + q^3 + r^3, where p, q and r are primes.at n=24A123597