Base | Representation |
---|---|
bin | 111001000010101… |
… | …0101001001111111 |
3 | 11221101112021101212 |
4 | 1302011111021333 |
5 | 12404440444444 |
6 | 513531355035 |
7 | 65300505632 |
oct | 16205251177 |
9 | 4841467355 |
10 | 1913999999 |
11 | 8a244858a |
12 | 454bb2a7b |
13 | 2466c5ca2 |
14 | 1422adc19 |
15 | b307619e |
hex | 7215527f |
1913999999 has 2 divisors, whose sum is σ = 1914000000. Its totient is φ = 1913999998.
The previous prime is 1913999981. The next prime is 1914000001. The reversal of 1913999999 is 9999993191.
It is a strong prime.
It is an emirp because it is prime and its reverse (9999993191) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1913999999 - 28 = 1913999743 is a prime.
It is a Sophie Germain prime.
Together with 1914000001, it forms a pair of twin primes.
It is a Chen prime.
1913999999 is a modest number, since divided by 99999 gives 19139 as remainder.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1913999959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 956999999 + 957000000.
It is an arithmetic number, because the mean of its divisors is an integer number (957000000).
Almost surely, 21913999999 is an apocalyptic number.
1913999999 is a deficient number, since it is larger than the sum of its proper divisors (1).
1913999999 is an equidigital number, since it uses as much as digits as its factorization.
1913999999 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14348907, while the sum is 68.
The square root of 1913999999 is about 43749.2856970260. The cubic root of 1913999999 is about 1241.5969709830.
The spelling of 1913999999 in words is "one billion, nine hundred thirteen million, nine hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •