16099
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17064
- Proper Divisor Sum (Aliquot Sum)
- 965
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15136
- Möbius Function
- 1
- Radical
- 16099
- 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
- 71
- 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
- Number of discordant permutations.at n=14A000561
- Conjectured formula for irreducible 5-fold Euler sums of weight 2n+13.at n=45A019450
- a(n) = T(n,n-3), array T as in A047130.at n=8A047135
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 4 leaves.at n=13A055365
- Coefficients of the C-Rogers mod 14 identity.at n=44A105782
- 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, 1, 1), (0, 1, -1), (1, -1, 1), (1, 0, 0)}.at n=9A148416
- Irregular array read by rows in which row n lists the smallest elements, in ascending order, of conjecturally all primitive cycles of positive integers under iteration by the Collatz-like 3x-k function, where k = A226630(n).at n=37A226623
- Conjectured record-breaking maximal values, for ascending positive integers k, of the minimal elements of the primitive cycles of positive integers under iteration by the Collatz-like 3x-k function.at n=5A226681
- Number of length 6+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=9A248543
- Number of length 3+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=18A250420
- Numbers m such that psi(x) = phi(m) has a solution while sigma(y) = phi(m) has none.at n=19A291524
- Numbers k such that 357*2^k+1 is prime.at n=49A323003
- Least number k such that there are exactly n cubefull numbers between k^3 and (k+1)^3.at n=12A337737
- Triangular array T(n, k) read by rows: denominators of the coefficients for the iterated exponential F^{r}(x) = x + Sum_{n>=1} x^(n+1)*Sum_{k=1..n} r^(n+1-k)*T(n, k)/A381931(n, k) with F^{1}(x) = exp(x)-1 and F^{2}(x) = exp(exp(x)-1)-1.at n=38A381932