15198
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32400
- Proper Divisor Sum (Aliquot Sum)
- 17202
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4736
- Möbius Function
- 1
- Radical
- 15198
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 58
- 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
- [ Sum{(sqrt(j+1)-sqrt(i+1))^3} ], 1 <= i < j <= n.at n=44A025223
- Numbers k such that k^4 contains a pandigital substring.at n=30A115934
- Number of sequences of length n starting with 1,2 which satisfy a recurrence a(k+1) = floor(c*a(k)) for some constant c.at n=10A117294
- Numbers n such that sigma(n) and sigma(sigma(n)) are both perfect squares.at n=11A134263
- 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, 1), (0, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=8A150148
- Number of binary strings of length n with no substrings equal to 0010 0101 or 0110.at n=14A164492
- Number of UUU's in all the dispersed Dyck paths of semilength n (i.e., in all Motzkin paths of length n; U=(1,1)).at n=17A191520
- a(n) is the smallest number which is the sum of two positive n-gonal numbers in more than one way.at n=15A199809
- Expansion of phi(x^2) / f(-x) in powers of x where phi(), f() are Ramanujan theta functions.at n=30A226622
- Triangle read by rows: T(n, k) = C(n, k)*C(2*k, k)/(k+1) - sum(j = 0..k, (-1)^j*(1-j)^n*C(k, j)/k!), 0<=k<=n.at n=52A247493
- Expansion of Product_{k>=1} ((1 + x^(k^2)) / (1 - x^(k^2)))^k.at n=41A291667