15298
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 22950
- Proper Divisor Sum (Aliquot Sum)
- 7652
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7648
- Möbius Function
- 1
- Radical
- 15298
- 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
- 115
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of n in which the least part is even.at n=46A026805
- Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 5).at n=49A035552
- Numbers n such that 10000000n+1, 10000000n+3, 10000000n+7, 10000000n+9 are all primes.at n=1A064966
- Number of partitions of n such that multiplicities of parts are all relatively prime to n.at n=38A100495
- Numbers k such that k^3 contains a pandigital substring.at n=12A115933
- 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, 0, 0), (0, -1, 1), (0, 1, 0), (1, -1, 0), (1, 1, -1)}.at n=9A148720
- 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, 0, 1), (0, 0, 1), (0, 1, -1), (1, -1, 1), (1, 1, 1)}.at n=7A150884
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 2 3 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=13A252107
- Expansion of e.g.f. log(1 + log(1 - 2*x)/2)^2 / 2.at n=6A383171
- G.f. satisfies A(x) = Product_{n>=0} (1 + (x*A(x)^3)^(3^n)).at n=7A391525