16054
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 9146
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7656
- Möbius Function
- -1
- Radical
- 16054
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 190
- 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
- The start of a record-breaking run of consecutive integers with a number of prime factors not equal to 2.at n=8A067650
- Number of compositions of n in which the least part is odd.at n=14A103419
- Numbers k such that prime(k) == 15 (mod k).at n=9A116662
- Expansion of 1/(1-x-x^3-x^6).at n=24A120415
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k blocks of length 2 (0 <= k <= floor(n/2)). A block of a permutation is a maximal sequence of consecutive integers which appear in consecutive positions. For example, the permutation 5412367 has 4 blocks: 5, 4, 123, and 67; one of them is of length 2.at n=21A184183
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..3 introduced in row major order.at n=37A231463
- Number of (2+1)X(n+1) 0..3 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..3 introduced in row major order.at n=7A231465
- G.f.: (1 + x/(1 + x^2/(1 + x^3/(1 + x^4/(1 + ...))))) / (1 - x/(1 - x^2/(1 - x^3/(1 - x^4/(1 - ...))))), a continued fraction.at n=19A285636
- a(n) = A289670(n)/2^f(n), where f(n) = 2*floor((n-1)/3) + ((n+2) mod 3).at n=46A289676
- a(n) = A289676(3*n+2).at n=15A290437
- Positive integers k such that the decimal representation of 2^k ends with some permutation of the string "0123456789".at n=3A347164
- Expansion of g.f. A(x) satisfying 1 = Sum_{n>=0} x^n / (1 - (-x)^(n+1)*A(x)).at n=10A363306
- Exponents k where A000120(3^k) - A070939(3^k)/2 reaches a new maximum.at n=36A372099