16878
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 6
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 35280
- Proper Divisor Sum (Aliquot Sum)
- 18402
- 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
- 1
- Radical
- 16878
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- Numbers with multiplicative persistence value 6.at n=13A046515
- Digitally balanced numbers in base 4: equal numbers of 0's, 1's, ... 3's.at n=22A049355
- Numbers n such that n | 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.at n=41A056751
- Nearest integer to log(n^n)^(1 + log(log(1 + n))).at n=25A062480
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,9.at n=19A064241
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,31.at n=2A064252
- 3*10^n-2*9^n.at n=4A097167
- Integers k such that 10^k+37 is a prime number.at n=25A135109
- Composite numbers whose multiplicative persistence is 6.at n=12A199996
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^3<=x^3+y^3.at n=30A211807
- Number of 0..2 arrays of length n+7 with sum less than 8 in any length 8 subsequence (=less than 50% duty cycle).at n=2A212725
- T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum less than 2*k in any length 2k subsequence (=less than 50% duty cycle).at n=17A212729
- Number of 0..2 arrays of length 2*n+2 with sum less than 2*n in any length 2n subsequence (=less than 50% duty cycle).at n=3A212732
- a(n) = number of partitions p of n such that the greatest multiplicity of the parts of p is a part of p.at n=41A365613