15022
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27360
- Proper Divisor Sum (Aliquot Sum)
- 12338
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 1
- Radical
- 15022
- 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
- 63
- 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
- Hexagonal pyramidal numbers, or greengrocer's numbers.at n=28A002412
- Even hexagonal pyramidal numbers.at n=13A015226
- Number of 5-tuples of different integers from [ 1,n ] with no common factors among triples.at n=22A015646
- Number of partitions of n into 9 unordered relatively prime parts.at n=41A023029
- The number phi_2(n) of Frobenius partitions that allow up to 2 repetitions of an integer in a row.at n=26A053993
- Numbers k such that k | 10^k + 9^k + 8^k + 7^k.at n=29A057214
- a(0)=a(1)=1. For n >= 2, if a(n-1) is coprime to n, then a(n) = a(n-1) + a(n-2). Otherwise, a(n)=1.at n=50A139047
- Number of parts of the n-th subshell of the head of the last section of the set of partitions of any even integer >= 2n.at n=19A182992
- Bernoulli number B_{n} has denominator 354.at n=35A255684
- G.f. satisfies: A(x)^2 = A( x^2/(1 - 2*x - 2*x^2) ).at n=10A274478
- Number of 3 X n 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=11A302311
- Position k of first term in a run of odd terms with length > 1 in A093714.at n=5A351498
- Partial sums of the ziggurat sequence A347186.at n=40A356351
- Number of maximal independent vertex sets in the n X n zebra graph.at n=6A367089