Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …000010001011011010010111 |
3 | 111101012011020201001012202101 |
4 | 113030131022002023122113 |
5 | 101332322022121113221 |
6 | 1000543113341222531 |
7 | 30326023635005443 |
oct | 2714351202133227 |
9 | 441164221035671 |
10 | 102011010332311 |
11 | 2a55a698a02653 |
12 | b536500b61a47 |
13 | 44bc79b7b1842 |
14 | 1b29505aa1823 |
15 | bbd8191ccd91 |
hex | 5cc74a08b697 |
102011010332311 has 2 divisors, whose sum is σ = 102011010332312. Its totient is φ = 102011010332310.
The previous prime is 102011010332291. The next prime is 102011010332369. The reversal of 102011010332311 is 113233010110201.
It is a weak prime.
It is an emirp because it is prime and its reverse (113233010110201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102011010332311 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102011010332711) 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, 51005505166155 + 51005505166156.
It is an arithmetic number, because the mean of its divisors is an integer number (51005505166156).
Almost surely, 2102011010332311 is an apocalyptic number.
102011010332311 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011010332311 is an equidigital number, since it uses as much as digits as its factorization.
102011010332311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 102011010332311 its reverse (113233010110201), we get a palindrome (215244020442512).
The spelling of 102011010332311 in words is "one hundred two trillion, eleven billion, ten million, three hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •