Base | Representation |
---|---|
bin | 100110001001… |
… | …0000011110101 |
3 | 1101121221121120 |
4 | 1030102003311 |
5 | 20104400132 |
6 | 1552334153 |
7 | 331654023 |
oct | 114220365 |
9 | 41557546 |
10 | 19996917 |
11 | 10318a86 |
12 | 6844359 |
13 | 41b1bc5 |
14 | 2927713 |
15 | 1b5002c |
hex | 13120f5 |
19996917 has 4 divisors (see below), whose sum is σ = 26662560. Its totient is φ = 13331276.
The previous prime is 19996871. The next prime is 19996927. The reversal of 19996917 is 71969991.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 71969991 = 3 ⋅23989997.
It is a cyclic number.
It is not a de Polignac number, because 19996917 - 26 = 19996853 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 19996917.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19996927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3332817 + ... + 3332822.
It is an arithmetic number, because the mean of its divisors is an integer number (6665640).
Almost surely, 219996917 is an apocalyptic number.
It is an amenable number.
19996917 is a deficient number, since it is larger than the sum of its proper divisors (6665643).
19996917 is an equidigital number, since it uses as much as digits as its factorization.
19996917 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6665642.
The product of its digits is 275562, while the sum is 51.
The square root of 19996917 is about 4471.7912518363. The cubic root of 19996917 is about 271.4278133602.
The spelling of 19996917 in words is "nineteen million, nine hundred ninety-six thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •