16877
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19296
- Proper Divisor Sum (Aliquot Sum)
- 2419
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14460
- Möbius Function
- 1
- Radical
- 16877
- Omega Function (Ω)
- 2
- 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
- 159
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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(0) = 1, a(n) = 27*n^2 + 2 for n>0.at n=25A010017
- Number of partitions of n into parts not of the form 23k, 23k+6 or 23k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=37A035994
- Integer part of log(n^n)^(1 + log(log(1 + n))).at n=25A062479
- Number of length n binary sequences with at most 2 of every adjacent 6 bits set.at n=21A133523
- Number of primes between A001605(n) and A001605(n+1).at n=43A134851
- 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, -1, 0), (0, 0, -1), (1, 1, 1)}.at n=8A149662
- Number of ways to place zero or more nonadjacent 0,0 1,0 2,1 2,2 3,1 3,2 4,3 4,4 polyhexes in any orientation on a planar nXnXn triangular grid.at n=8A155407
- (n^3 - n + 15)/3.at n=36A155757
- Number of partitions of n into distinct parts with boundary size 6.at n=48A227563
- Molien series for invariants of finite Coxeter group A_10.at n=55A266779
- Number of nX4 0..1 arrays with every element unequal to 0, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=5A306132
- Number of nX6 0..1 arrays with every element unequal to 0, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A306134
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=39A306136
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=41A306136
- Number of nX6 0..1 arrays with every element unequal to 0, 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A317269
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=39A317271
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=41A317271