16152
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 40440
- Proper Divisor Sum (Aliquot Sum)
- 24288
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 4038
- Omega Function (Ω)
- 5
- 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
- 115
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = ceiling(n*phi^13), where phi is the golden ratio, A001622.at n=31A004968
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 11.at n=11A031689
- a(n) = (1/2) * Sum_{k=1..n} (-1)^(k-1) * binomial(2*n-k, k) * binomial(n, k) * 2^k * (2*n-2*k)!.at n=3A159960
- Row sums of A163357 and A163359.at n=27A163365
- Number of partitions p of 2n such that n - (number of parts of p) is a part of p.at n=21A238607
- Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to 2*n, when there are at least two such x's.at n=25A253303
- Ulam numbers k such that k/3 is also an Ulam number.at n=28A287212
- Anagrexpo integers: integers N that exactly reproduce their set of digits when we form the set of exponentiation of pairs of adjacent digits, from left to right.at n=28A297627
- Number of cyclic binary sequences of length n containing no abelian 4th powers.at n=36A305594
- a(n) = Sum_{k=0..n} r_4(k^2 + 1), where r_4(k) is the number of ways of writing k as a sum of 4 squares (A000118).at n=16A333174