15899
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17136
- Proper Divisor Sum (Aliquot Sum)
- 1237
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14664
- Möbius Function
- 1
- Radical
- 15899
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 159
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Upper members of a "good pair" of the form (k, 2*k +- 1).at n=44A046862
- Composite n such that both n and its reversal in base 10 are squarefree, none of the prime factors of n are palindromes and the prime factors of the reversal of n are the reversals of those of n.at n=6A083526
- G.f. x^2*(1+x)/(1-12*x+15*x^2-2*x^3).at n=5A122011
- 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, -1), (1, -1, 0), (1, 1, -1), (1, 1, 1)}.at n=8A149596
- Odd nonprimes n such that n+d+1 is prime for all divisors d of n.at n=32A187554
- Number of (n+2)X(1+2) 0..3 arrays with every row, column, diagonal or antidiagonal in each 3X3 subblock summing to a prime.at n=2A251846
- Number of (n+2)X(3+2) 0..3 arrays with every row, column, diagonal or antidiagonal in each 3X3 subblock summing to a prime.at n=0A251848
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every row, column, diagonal or antidiagonal in each 3X3 subblock summing to a prime.at n=3A251852
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every row, column, diagonal or antidiagonal in each 3X3 subblock summing to a prime.at n=5A251852
- Smallest k such that A257743(k)=n.at n=19A257744
- Least number of consecutive primes beginning with 2, the sum of which (A007504) exceeds e^n.at n=21A323361
- Number of partitions of n in which exactly one even part is repeated and odd parts are unrestricted.at n=38A353902
- Number of partitions of n with rank a multiple of 4.at n=42A363233