16370
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29484
- Proper Divisor Sum (Aliquot Sum)
- 13114
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6544
- Möbius Function
- -1
- Radical
- 16370
- 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
- 128
- 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
- a(n) = 2^n - n.at n=14A000325
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ (n/k)*[ n/k ] ] ].at n=21A024933
- Smallest index i such that next_prime( 2*prime(i) ) - 2*prime(i) = 2n - 1.at n=43A074973
- a(n) = ceiling(n^(1/n))^n - n.at n=13A076878
- a(n) = 2^(2*n) - 2*n.at n=7A100103
- Double, add 0, double, add 1, double, add 2, double, add 3, etc.at n=26A147678
- Fibonacci-Chebyshev sequence depending on rabbit sequence A005614.at n=45A176741
- Fibonacci-Chebyshev sequence depending on rabbit sequence A005614.at n=48A176741
- Fibonacci-Chebyshev sequence depending on rabbit sequence A005614.at n=51A176741
- (1/4) * number of ways to select 3 distinct collinear points from a square of grid points with side length n.at n=16A320540