16633
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
- 16634
- 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
- 16632
- Möbius Function
- -1
- Radical
- 16633
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 203
- 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
- 1924
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of the form k^2 - 8.at n=29A028886
- Numbers k such that 153*2^k+1 is prime.at n=23A032453
- Primes with 15 as smallest positive primitive root.at n=4A061328
- Primes such that the sum of their digits and the sum of the reciprocals of their digits is also prime.at n=10A064779
- In base 2: smallest integer which requires n 'Reverse and Add' steps to reach a palindrome.at n=42A066058
- Primes for which the smallest positive primitive root is odd and nonprime.at n=9A070269
- Numbers n such that the number formed by the digits of 2n sorted in descending order is equal to the sum of the divisors of n after the digits of each divisor have been sorted in descending order (all zeros dropped).at n=4A083389
- Primes of the form prime(n)*prime(n+1) - 4.at n=13A092761
- Product of first n Lucas numbers, plus one.at n=6A103845
- Smallest prime such that n*k(n)^2+n*k(n)+1 is a prime > (n-1)*k(n-1)^2+(n-1)*k(n-1)+1 with k(n)>1 or 0 if n=4 as no prime possible.at n=21A104995
- Numbers whose base-10 and base-7 representations are permutations of the same multiset of digits.at n=34A130604
- Least prime P such that P^(2*prime(n))-P^prime(n)-1 is prime with prime(n) the n-th prime.at n=40A131580
- a(n) = 15*n^2 + 9*n + 1.at n=33A134153
- a(n) = 1 + n*(n+1)*(n^2-n+12)/12.at n=21A136396
- a(n) = 3*a(n-1) + 7*a(n-2), with a(1) = 1, a(2) = 10.at n=6A137280
- Primes of the form x^2 + 1848*y^2.at n=43A139668
- Primes of the form prime(x)*prime(x+1) - (prime(x+1)-prime(x)).at n=8A140120
- Primes of the form 57x^2+18xy+193y^2.at n=29A140631
- Primes congruent to 42 mod 47.at n=37A142393
- Primes congruent to 44 mod 53.at n=37A142574