Base | Representation |
---|---|
bin | 1010010001110100000000… |
… | …0001101010000100100011 |
3 | 1111000101012101202210000212 |
4 | 2210131000001222010203 |
5 | 2440124210040211232 |
6 | 40011400251404335 |
7 | 2244323420444012 |
oct | 244350001520443 |
9 | 44011171683025 |
10 | 11301133132067 |
11 | 3667869040099 |
12 | 132629a7536ab |
13 | 63c8ccc340bc |
14 | 2b0d98d9ca79 |
15 | 148e7d595eb2 |
hex | a474006a123 |
11301133132067 has 2 divisors, whose sum is σ = 11301133132068. Its totient is φ = 11301133132066.
The previous prime is 11301133131997. The next prime is 11301133132087. The reversal of 11301133132067 is 76023133110311.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (76023133110311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11301133132067 - 232 = 11296838164771 is a prime.
It is a super-3 number, since 3×113011331320673 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (11301133132087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5650566566033 + 5650566566034.
It is an arithmetic number, because the mean of its divisors is an integer number (5650566566034).
Almost surely, 211301133132067 is an apocalyptic number.
11301133132067 is a deficient number, since it is larger than the sum of its proper divisors (1).
11301133132067 is an equidigital number, since it uses as much as digits as its factorization.
11301133132067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 32.
Adding to 11301133132067 its reverse (76023133110311), we get a palindrome (87324266242378).
The spelling of 11301133132067 in words is "eleven trillion, three hundred one billion, one hundred thirty-three million, one hundred thirty-two thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •