16453
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16454
- 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
- 16452
- Möbius Function
- -1
- Radical
- 16453
- 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
- 40
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1908
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 63.at n=21A020402
- Number of 1's in n-th term of A022470.at n=36A022472
- Primes that remain prime through 3 iterations of function f(x) = 5x + 2.at n=22A023283
- Primes that remain prime through 3 iterations of function f(x) = 9x + 2.at n=34A023296
- Sums of 4 distinct powers of 4.at n=36A038472
- Numbers whose base-4 representation contains exactly four 0's and four 1's.at n=1A045037
- Euclid-Mullin sequence (A000945) with initial value a(1)=59 instead of a(1)=2.at n=16A051321
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 23.at n=26A051964
- Primes which can be expressed as sum of distinct powers of 4.at n=18A077718
- a(1)=2; a(n) for n>1 is the smallest prime number > a(n-1) such that the concatenation of all previous terms is also prime.at n=29A080155
- Recursive binary interleaving code for rooted plane binary trees, as ordered by A014486.at n=22A082856
- Numbers k such that 9*10^k + 7 is prime.at n=21A096774
- Prime numbers which when written in base 7 have a composite digit-sum.at n=33A096790
- Primes p such that q-p = 24, where q is the next prime after p.at n=24A098974
- XOR difference triangle, read by rows, of A099898 (in leftmost column) such that the main diagonal equals A099898 shift left and divided by 4.at n=35A099897
- Multiplies by 4 and shifts right under the XOR BINOMIAL transform (A099898).at n=7A099899
- Stern-Jacobsthal numbers.at n=29A101624
- A bisection of the Stern-Jacobsthal numbers.at n=15A101625
- Primes p such that the largest prime factor of p^5 + 1 is less than p.at n=5A102327
- Let p = prime(sigma(n)) and q = prime(phi(n)), then p is in the sequence if p-q = 6.at n=21A103176