Base | Representation |
---|---|
bin | 10111000010010001010110… |
… | …101001001000011010110011 |
3 | 111021201020202200200102212101 |
4 | 113002101112221020122303 |
5 | 101234340204400413021 |
6 | 555245410214241231 |
7 | 30224326356024661 |
oct | 2702212651103263 |
9 | 437636680612771 |
10 | 101311142201011 |
11 | 2a30a8a5661956 |
12 | b442940656217 |
13 | 446b7a4765b22 |
14 | 1b036b20c5c31 |
15 | baa5069c2a91 |
hex | 5c2456a486b3 |
101311142201011 has 2 divisors, whose sum is σ = 101311142201012. Its totient is φ = 101311142201010.
The previous prime is 101311142200969. The next prime is 101311142201039. The reversal of 101311142201011 is 110102241113101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101311142201011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101311142201011.
It is not a weakly prime, because it can be changed into another prime (101311142201041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50655571100505 + 50655571100506.
It is an arithmetic number, because the mean of its divisors is an integer number (50655571100506).
Almost surely, 2101311142201011 is an apocalyptic number.
101311142201011 is a deficient number, since it is larger than the sum of its proper divisors (1).
101311142201011 is an equidigital number, since it uses as much as digits as its factorization.
101311142201011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 101311142201011 its reverse (110102241113101), we get a palindrome (211413383314112).
The spelling of 101311142201011 in words is "one hundred one trillion, three hundred eleven billion, one hundred forty-two million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •