16337
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17874
- Proper Divisor Sum (Aliquot Sum)
- 1537
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14880
- Möbius Function
- 0
- Radical
- 527
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 66
- 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
- no
- Odd
- yes
Appears in sequences
- a(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=33A010005
- Composite numbers n such that k! == 1 (mod n) for some k > 2.at n=19A049048
- Transform of Catalan numbers whose Hankel transform gives the Somos-4 sequence.at n=11A157002
- The number of distinct primes < 10^n which are members of twin-prime pairs.at n=5A167874
- a(n) = p^2*(p + 3)/2, where p = prime(n).at n=10A179546
- Number of n-digit 10th powers.at n=48A216654
- a(n) = 17*n^2.at n=31A244630
- Number of permutations of [n] with every alternating run of length less than 3 in which the last alternating run has length 2.at n=9A246014
- a(n) = 2^(n - 1) - prime(n).at n=14A277801
- a(n) = 4*n^3 - 3*n + 1.at n=16A280089
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 590", based on the 5-celled von Neumann neighborhood.at n=13A283177
- a(n) = (Sum_{i=1..n-1} i^(n-2)) mod n^3.at n=30A284759
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n*b(n-1), where a(0) = 2, a(1) = 3, b(0) = 1, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A296291
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2 or 4 king-move adjacent elements, with upper left element zero.at n=8A303797
- Nested base shift convergence sequence (NBSC): gives the constant term of the convergence of a number n into a base sequence conversion nest: a(n) = ...FromDigits(IntegerDigits(FromDigits(IntegerDigits(n,2),3),4),5)..., until the result does not change for more iterations.at n=27A326653
- Numbers p^2*q, p > q odd primes such that q does not divide p-1, and q does not divide p+1.at n=31A350421
- Numbers that are the concatenation of three (not necessarily distinct) primes whose sum is prime, and are also the product of three (not necessarily distinct) primes whose sum is prime.at n=39A385452