Base | Representation |
---|---|
bin | 111100010001110… |
… | …110010111110111 |
3 | 2121110221222102102 |
4 | 330101312113313 |
5 | 4032343441434 |
6 | 244203532315 |
7 | 34030003556 |
oct | 7421662767 |
9 | 2543858372 |
10 | 1011312119 |
11 | 47994a844 |
12 | 24282a09b |
13 | 13169b04c |
14 | 98453d9d |
15 | 5dbb807e |
hex | 3c4765f7 |
1011312119 has 2 divisors, whose sum is σ = 1011312120. Its totient is φ = 1011312118.
The previous prime is 1011312079. The next prime is 1011312121. The reversal of 1011312119 is 9112131101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011312119 is a prime.
It is a super-2 number, since 2×10113121192 = 2045504404072540322, which contains 22 as substring.
Together with 1011312121, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1011312119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011312179) 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, 505656059 + 505656060.
It is an arithmetic number, because the mean of its divisors is an integer number (505656060).
Almost surely, 21011312119 is an apocalyptic number.
1011312119 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011312119 is an equidigital number, since it uses as much as digits as its factorization.
1011312119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 20.
The square root of 1011312119 is about 31801.1339263241. The cubic root of 1011312119 is about 1003.7565767934.
The spelling of 1011312119 in words is "one billion, eleven million, three hundred twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •