16092
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
- 24
- Divisor Sum
- 42000
- Proper Divisor Sum (Aliquot Sum)
- 25908
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5328
- Möbius Function
- 0
- Radical
- 894
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- 45
- 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
- Third step in Goodstein sequences, i.e., g(5) if g(2)=n: write g(4)=A057650(n) in hereditary representation base 4, bump to base 5, then subtract 1 to produce g(5).at n=11A059934
- Triangle read by rows where the n-th row is the first row of M^n, with M the (n+1)-by-(n+1) matrix with (1,3,1,3,1,3,...) on its main diagonal and (3,1,3,1,3,1,...) on its superdiagonal.at n=51A124572
- Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2 = A127483(k+3) - 3.at n=4A127486
- Number of binary strings of length n with equal numbers of 00010 and 01101 substrings.at n=15A164219
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=0, k=-1 and l=0.at n=12A176854
- Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.at n=17A192761
- Number of -2..2 arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences.at n=4A200198
- T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences.at n=19A200204
- Number of -n..n arrays x(0..7) of 8 elements with zero sum and nonzero second and third differences.at n=1A200209
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 2.at n=33A209984
- Main diagonal starting k=2 of array A(k,n) = numbers n such that n^k - prime(n) is a prime.at n=43A213477
- T(n,k)=Number of arrays of n 0..k integers with no sum of consecutive elements equal to a disjoint adjacent sum of an equal number of elements.at n=59A215190
- Number of arrays of 5 0..n integers with no sum of consecutive elements equal to a disjoint adjacent sum of an equal number of elements.at n=6A215192
- Number of partitions of n with difference 10 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=36A242701
- Sixth pi-based arithmetic derivative of n.at n=52A258856
- Seventh pi-based arithmetic derivative of n.at n=24A258857
- a(n) = A000787(n) + 1.at n=45A259984
- a(n) = G_n(13), where G is the Goodstein function defined in A266201.at n=3A271560
- Number of nX3 0..2 arrays with no element equal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=3A279324
- Number of nX4 0..2 arrays with no element equal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=2A279325