15333
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21600
- Proper Divisor Sum (Aliquot Sum)
- 6267
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9648
- Möbius Function
- -1
- Radical
- 15333
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Sum of fourth powers: 0^4 + 1^4 + ... + n^4.at n=9A000538
- a(n) = 1^n + 2^n + ... + 9^n.at n=4A001556
- Lucky numbers with size of gaps equal to 20 (upper terms).at n=33A031903
- Denominators of continued fraction convergents to sqrt(949).at n=9A042837
- Smallest m such that A051145(m) = 2^n.at n=22A051147
- Lucky numbers for which both the sum of the digits and the product of the digits is also a lucky number.at n=32A118559
- The sequence a[n]+b[n]+c[n]+d[n] defined in A126940.at n=8A126945
- G.f.: A(x) = F(x*G(x)^3) where F(x) = G(x*F(x)) = 1 + x*F(x)^3 is the g.f. of A001764 and G(x) = F(x/G(x)) = 1 + x*G(x)^2 is the g.f. of A000108 (Catalan).at n=6A153392
- Number of binary strings of length n with no substrings equal to 0000 0010 or 1101.at n=17A164424
- Number of strings of numbers x(i=1..8) in 0..n with sum i^3*x(i)^2 equal to 512*n^2.at n=11A184309
- Mirror of the triangle A193961.at n=46A193962
- Least k such that k*30^n-1 , k*30^n+1, and 2*k*30^n-1 are prime; that is, twin primes and a Sophie Germain prime.at n=28A212956
- G.f.: A(x,y) = exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^5 * y^k] * x^n/n ) = Sum_{n>=0,k=0..n} T(n,k)*x^n*y^k, as a triangle of coefficients T(n,k) read by rows.at n=46A218115
- a(n) = Sum_{i=0..n} digsum(i)^4, where digsum(i) = A007953(i).at n=9A231689
- Positions at which powers of 2 occur in A051145.at n=30A244747
- a(n) = Sum_{1 <= j <= n/2, gcd(j,n)=1} j^4.at n=18A295576
- Numbers that are the sum of nine fourth powers in ten or more ways.at n=24A345594
- Numbers that are the sum of nine fourth powers in exactly ten ways.at n=22A345852