16273
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16274
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16272
- Möbius Function
- -1
- Radical
- 16273
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 159
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1891
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=37A031830
- Number of cyclic compositions of n into parts >= 2.at n=26A032190
- Primes whose consecutive digits differ by 4 or 5.at n=23A048416
- First term of strong prime quintets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).at n=37A054808
- Gives an LCD representation of n.at n=18A071843
- Prime numbers occurring at integer Pythagorean distance (radius) from 1 in Ulam square prime-spiral. Primes on axes are excluded.at n=25A078765
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 8.at n=32A109562
- Primes of the form 9*k^4 - 204*k^3 + 1777*k^2 - 7038*k + 10729, for k >= 0, listed by increasing k.at n=12A117090
- Primes p such that q-p = 28, where q is the next prime after p.at n=13A124595
- Floor of sum of the first n^2 square roots.at n=29A138357
- Primes congruent to 11 mod 47.at n=39A142362
- Primes congruent to 48 mod 59.at n=37A142775
- Primes congruent to 47 mod 61.at n=31A142845
- Primes P(n) such that 2*P(n) - P(n+1) has all factors less than P(n+1) - P(n). This means that no prime less than P(n) can divide P(n) to give a remainder added to P(n) to give P(n+1).at n=43A155128
- A (1,3) Somos-4 sequence.at n=7A174170
- Primes p such that 2*p^4+-9 are also prime.at n=13A174365
- a(n) = Sum_{k<=n} A007955(k) * A007955(k) = Sum_{k<=n} A007955(k)^2, where A007955(m) = product of divisors of m.at n=9A174939
- Honaker primes of the form p = 2*k-1 with sum-of-digits(p) = sum-of-digits(k).at n=9A176111
- Pairs of consecutive primes {p,q} for which the numbers of distinct residues of all factorials mod p and mod q coincide.at n=29A210242
- Total number of parts of multiplicity 4 in all partitions of n.at n=39A222704