15458
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23760
- Proper Divisor Sum (Aliquot Sum)
- 8302
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7540
- Möbius Function
- -1
- Radical
- 15458
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 146
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Pseudoprimes to base 63.at n=34A020191
- a(n) = (2*n+1)*(9*n+1).at n=29A033573
- Solution to the Dancing School Problem with 8 girls and n+8 boys: f(8,n).at n=4A079913
- Solution to the Dancing School Problem with n girls and n+4 boys: f(n,4).at n=7A079923
- Numbers k such that the digits of k^3, reversed, include the digits of k as substring.at n=17A115762
- Numbers m having the same sum of divisors as m+20 has.at n=28A181647
- Number of idempotent 3X3 0..n matrices.at n=33A222822
- Number of n X n 0..2 matrices with each 2 X 2 subblock idempotent.at n=10A224659
- Numbers of quasi-pyramid polycubes of a given volume (number of atomic cells).at n=15A230119
- a(n) is the smallest b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^3).at n=17A249275
- Number of (n+2) X (4+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000101 or 00000111.at n=16A261707
- G.f. satisfies A(x) = (1 + x*A(x))^2 * (1 + x^2*A(x)^3).at n=7A274378
- 11-gonal numbers which are products of three distinct primes.at n=14A354446
- T(n,k) is the total number of levels in all Dyck paths of semilength n containing exactly k path nodes; triangle T(n,k), n>=0, 1<=k<=n+1, read by rows.at n=58A371928