16830
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 50544
- Proper Divisor Sum (Aliquot Sum)
- 33714
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 5610
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 5
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 110
- 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
- yes
- Odd
- no
Appears in sequences
- Digitally balanced numbers in base 4: equal numbers of 0's, 1's, ... 3's.at n=20A049355
- a(n) = LCM_{k=0..n} (2^k + 1).at n=5A051844
- The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to Pi.at n=37A057082
- Least common multiple of all (k+1)'s, where the k's are the positive divisors of n.at n=31A057643
- Denominators of convergents to Pi by Farey fractions.at n=16A063673
- Successive maxima in sequence A007365.at n=10A065933
- Composite numbers k such that the difference between the odd and even aliquot parts of k divides k.at n=19A066193
- Partition of positive integers into shortest possible groups, starting with (1), (2,3), (4,5,6), (7,8,9,10,11), such that a(n) = the sum of the terms of the n-th group is a multiple of a(n-1) and a(n) > a(n-1).at n=5A079798
- Numbers n such that n^3 is the sum of three or more consecutive positive cubes.at n=14A097811
- Number of partitions of 2n free of multiples of 5. All odd parts occur with multiplicity 2 or 4. the even parts occur at most twice.at n=36A103257
- Numbers m such that m is k*(the sum of decimal digits squared of m), k=153 case.at n=5A117810
- Triangle of numbers obtained from the partition array A134145.at n=39A134146
- Composites one larger than a prime, with exactly five distinct prime factors.at n=35A136154
- Number of different strings of length n+4 obtained from "123...n" by iteratively duplicating any substring.at n=20A137741
- 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, 0, 0), (0, 1, -1), (1, -1, 0), (1, 0, 1)}.at n=9A148923
- Averages of twin prime pairs of the form : sum of two or more consecutive squares.at n=13A174716
- Smallest k such that the partial sums of the divisors of k (in decreasing order) generate n primes.at n=8A187825
- Numbers with prime factorization pqrst^2.at n=25A189983
- Numbers k with equal remainders of (product of divisors of k) mod (sum of divisors of k) and (product of proper divisors of k) mod (sum of proper divisors of k).at n=35A192035
- Monotonic ordering of set S generated by these rules: if x and y are in S then floor(x*y/2) is in S, and 5 is in S.at n=31A192520