15054
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
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32592
- Proper Divisor Sum (Aliquot Sum)
- 17538
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 1
- Radical
- 15054
- 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
- 151
- 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
- Number of 5-ary rooted trees with n nodes and height exactly 8.at n=15A036639
- First differences of A057809.at n=34A087238
- Even numbers that are not congruent to 1 mod 3 nor are squares nor are the sum of a prime and a square of a prime.at n=10A109136
- Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k+1) for k >= 1.at n=46A126953
- a(n) = (prime(n)^2 + prime(n+1))/2.at n=38A140511
- a(n)=Mod(3^Fibonacci(n),Fibonacci(n)).at n=21A171961
- Number of partitions of n with difference 6 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=38A242697
- Numbers n such that Bernoulli number B_{n} has denominator 3318.at n=11A272383
- a(n) = 27*n^2 - 21*n + 6 (n>=1).at n=23A304164
- Numbers k == 0 or 2 (mod 6) which are not the sum of a prime and the square of a prime.at n=22A306394
- a(0) = 1; for n > 0, a(n) = Sum_{k=0..n-1} prime(a(k)) * prime(a(n-k-1)).at n=4A338816