14891
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
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14892
- 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
- 14890
- Möbius Function
- -1
- Radical
- 14891
- 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
- 133
- 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
- 1745
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Coordination sequence for MgNi2, Position Mg2.at n=30A009935
- Discriminants of quintic fields with 2 complex conjugates (negated).at n=22A023684
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers).at n=38A024588
- Palindromic primes in base 4.at n=37A029972
- Palindromic primes in base 8.at n=37A029976
- Palindromic primes in bases 4 and 8.at n=6A056146
- Primes which, although they have correct parity, are not in the prime number maze.at n=26A065123
- Primes of the form k^2 + 7.at n=33A079138
- Number of unimodal compositions of n+2 where the maximal part appears exactly twice.at n=26A114921
- Numbers k such that 2^(k+1) + 3^k is prime.at n=49A123924
- a(n) = 15*n*(n+1) + 11.at n=31A132208
- Primes congruent to 13 mod 43.at n=38A142262
- Primes congruent to 39 mod 47.at n=37A142390
- Primes congruent to 44 mod 49.at n=40A142451
- Primes congruent to 51 mod 53.at n=33A142581
- Primes congruent to 23 mod 59.at n=34A142750
- Primes congruent to 7 mod 61.at n=34A142805
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 1, 0), (1, -1, -1), (1, 1, 1)}.at n=8A149553
- Triangular array T(m,n), 1<=n<=m, giving the minimum positive number of deals of m cards into n piles required to collect all cards in the first pile. Each deal tosses all cards from a pile, the last dealt card indicates a pile to deal next, each deal tosses one card consecutively to the first, 2nd, ..., n-th, first, 2nd, ... pile.at n=63A161135
- Primes of the form (p^2+2)/33 (with p prime).at n=11A165673