16899
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 33
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23232
- Proper Divisor Sum (Aliquot Sum)
- 6333
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10920
- Möbius Function
- -1
- Radical
- 16899
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (4*n+1)*(4*n+3).at n=32A001539
- Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).at n=42A051937
- Number of nonempty subsets of the set of vertices of a regular n-gon in the plane such that their center of gravity is the center of the polygon.at n=26A070894
- Smallest squarefree integer k such that Q(sqrt(k)) has class number n.at n=39A081363
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=42A083752
- Largest integer not expressible as a nonnegative linear combination of n and n^2 + 1.at n=25A087908
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 0, 1), (1, 0, -1), (1, 1, -1)}.at n=9A148807
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, -1), (1, -1, 0), (1, 1, 1)}.at n=8A149602
- a(n) = 676*n - 1.at n=24A158393
- Combined weight, as defined at A234094, of the partitions of n.at n=15A234097
- Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3 or 5.at n=33A254830
- Number of nX3 0..1 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.at n=8A267639
- Numbers k such that (14*10^k + 73)/3 is prime.at n=30A271340
- After a(0)=0, numbers n such that (A002828(1+n) = 1) and (A002828(4+n) = 4).at n=49A278491
- Least common multiple of 5*n+1 and 5*n-1.at n=26A282285
- 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 581", based on the 5-celled von Neumann neighborhood.at n=14A283134
- Number of subsets of {1..n} containing the sum of every subset whose sum is <= n.at n=22A326080
- Number of integer partitions of n such that the dual of the multiset partition obtained by factoring each part into prime numbers is a (strict) antichain, also called T_1 integer partitions.at n=38A326977
- Composite numbers k such that P(k, 7) == 7 (mod k), where P(k, 7) = A084768(k) is the k-th Legendre polynomial evaluated at 7.at n=17A330205
- Starts of runs of 3 consecutive anti-tau numbers (A046642).at n=29A341780