Base | Representation |
---|---|
bin | 10010100111100011… |
… | …101110100101100101 |
3 | 1220121012122112212212 |
4 | 102213203232211211 |
5 | 311420200430432 |
6 | 13103405053205 |
7 | 1305252644432 |
oct | 224743564545 |
9 | 56535575785 |
10 | 19991030117 |
11 | 85294628a3 |
12 | 3a5ab57205 |
13 | 1b67886c06 |
14 | d7902cb89 |
15 | 7c00982b2 |
hex | 4a78ee965 |
19991030117 has 2 divisors, whose sum is σ = 19991030118. Its totient is φ = 19991030116.
The previous prime is 19991030069. The next prime is 19991030153. The reversal of 19991030117 is 71103019991.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19022202241 + 968827876 = 137921^2 + 31126^2 .
It is a cyclic number.
It is not a de Polignac number, because 19991030117 - 26 = 19991030053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19991030617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9995515058 + 9995515059.
It is an arithmetic number, because the mean of its divisors is an integer number (9995515059).
Almost surely, 219991030117 is an apocalyptic number.
It is an amenable number.
19991030117 is a deficient number, since it is larger than the sum of its proper divisors (1).
19991030117 is an equidigital number, since it uses as much as digits as its factorization.
19991030117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15309, while the sum is 41.
The spelling of 19991030117 in words is "nineteen billion, nine hundred ninety-one million, thirty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •