Base | Representation |
---|---|
bin | 10101001101111000… |
… | …00100110011011111 |
3 | 1002101211121112221012 |
4 | 22212330010303133 |
5 | 141312004411032 |
6 | 5122142125435 |
7 | 552162234065 |
oct | 124674046337 |
9 | 32354545835 |
10 | 11390700767 |
11 | 4915832096 |
12 | 225a88087b |
13 | 10c6b61334 |
14 | 7a0b34035 |
15 | 46a0176b2 |
hex | 2a6f04cdf |
11390700767 has 2 divisors, whose sum is σ = 11390700768. Its totient is φ = 11390700766.
The previous prime is 11390700733. The next prime is 11390700787. The reversal of 11390700767 is 76700709311.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11390700767 - 216 = 11390635231 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11390700787) 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, 5695350383 + 5695350384.
It is an arithmetic number, because the mean of its divisors is an integer number (5695350384).
Almost surely, 211390700767 is an apocalyptic number.
11390700767 is a deficient number, since it is larger than the sum of its proper divisors (1).
11390700767 is an equidigital number, since it uses as much as digits as its factorization.
11390700767 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55566, while the sum is 41.
The spelling of 11390700767 in words is "eleven billion, three hundred ninety million, seven hundred thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •