15297
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
- 4
- Divisor Sum
- 20400
- Proper Divisor Sum (Aliquot Sum)
- 5103
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10196
- Möbius Function
- 1
- Radical
- 15297
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 82.at n=34A031580
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.at n=38A088753
- Numbers n with nonzero digits in their decimal representation such that when all numbers formed by inserting the exponentiation symbol between any two digits are added up, the sum is prime.at n=46A113762
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k primitive non-Dyck factors (n>=0; 0<=k<=floor((n+1)/3)).at n=27A129157
- G.f.: A(x) = 1 + x*A_1(x)^2; A_1(x) = (1+x) + x*A_2(x)^2; A_2(x) = (1+x)^2 + x*A_3(x)^2; ...; A_{n}(x) = (1+x)^n + x*A_{n+1}(x)^2 for n>=0 with A(x) = A_0(x).at n=7A138294
- 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), (-1, 0, 1), (-1, 1, 1), (0, 0, 1), (1, 0, -1)}.at n=10A148315
- G.f.: A(x) = exp( Sum_{n>=1} A069865(n)*x^n/n ) where A069865(n) = Sum_{k=0..n} C(n,k)^6.at n=4A218119
- Total number of parts of multiplicity 5 in all partitions of n.at n=40A222705
- Number of (n+1) X (5+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=7A250726
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome and does not join the trajectory or one of the reverse numbers of the trajectory of any term m < k.at n=36A306232
- Numbers k such that one of k, k+1, k+2 is prime and the other two are semiprimes, and one of R(n), R(n+1), R(n+2) is prime and the other two are semiprimes, where R = A004086.at n=9A354285