Base | Representation |
---|---|
bin | 1001000110101110010011… |
… | …0110100010101111100011 |
3 | 1022110001102200212112120121 |
4 | 2101223210312202233203 |
5 | 2303010230001144021 |
6 | 33143013021421111 |
7 | 2052164502016522 |
oct | 221534466425743 |
9 | 38401380775517 |
10 | 10011113303011 |
11 | 320a76451a067 |
12 | 115827970a797 |
13 | 5780756a3772 |
14 | 26877d0944b9 |
15 | 12562a913741 |
hex | 91ae4da2be3 |
10011113303011 has 2 divisors, whose sum is σ = 10011113303012. Its totient is φ = 10011113303010.
The previous prime is 10011113302999. The next prime is 10011113303071. The reversal of 10011113303011 is 11030331111001.
It is a weak prime.
It is an emirp because it is prime and its reverse (11030331111001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10011113303011 - 221 = 10011111205859 is a prime.
It is a super-2 number, since 2×100111133030112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10011113303071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005556651505 + 5005556651506.
It is an arithmetic number, because the mean of its divisors is an integer number (5005556651506).
Almost surely, 210011113303011 is an apocalyptic number.
10011113303011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011113303011 is an equidigital number, since it uses as much as digits as its factorization.
10011113303011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 10011113303011 its reverse (11030331111001), we get a palindrome (21041444414012).
The spelling of 10011113303011 in words is "ten trillion, eleven billion, one hundred thirteen million, three hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •