16890
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 40608
- Proper Divisor Sum (Aliquot Sum)
- 23718
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4496
- Möbius Function
- 1
- Radical
- 16890
- 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
- 172
- Smith Number
- yes
- 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
- Expansion of e.g.f. sin(tanh(x) + log(x+1)).at n=9A013118
- Digitally balanced numbers in base 4: equal numbers of 0's, 1's, ... 3's.at n=23A049355
- Smallest m such that A065623(m) = n.at n=27A065624
- a(n) = 169*n^2 - n.at n=9A157998
- a(n) = 676*n^2 - 2*n.at n=4A158392
- a(n) = 100*n^2 - 10.at n=12A158490
- Solutions a(n) of (a(n)-5)*(a(n)-6) = 21*b(n)*(b(n)-1).at n=8A180509
- Number of partitions of n having no parts with multiplicity 4.at n=37A184639
- Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,0,1,1,1 for x=0,1,2,3,4.at n=4A197273
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,1,1 for x=0,1,2,3,4.at n=4A197277
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,0,1,1,1 for x=0,1,2,3,4.at n=40A197280
- Number of partitions of n such that the number of parts and the largest part and the smallest part are pairwise not coprime.at n=55A200476
- a(n) = 7*n^2 + 2*n - 15.at n=48A239796
- Numbers k with the property that p = k^2 - 11 and q = k^2 + 11 are consecutive primes.at n=25A248790
- Number of (n+1) X (7+1) 0..1 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=11A251127
- a(n) = 2^n - Sum_{m=0..n} binomial(n/gcd(n,m), m/gcd(n,m)) = 2^n - A082906.at n=14A271834
- Numbers k such that (25*10^k - 73) / 3 is prime.at n=24A276845
- Numbers k such that Bernoulli number B_{k} has denominator 14322.at n=21A295588
- Number of maximal subsets of {1..n} containing n such that every ordered pair of distinct elements has a different difference.at n=33A325880