Base | Representation |
---|---|
bin | 10110111110001101101010… |
… | …011110101011100001101111 |
3 | 111020201121000211220020121111 |
4 | 112332031222132223201233 |
5 | 101220303123321200221 |
6 | 554513333204012451 |
7 | 30165225426366235 |
oct | 2676155236534157 |
9 | 436647024806544 |
10 | 101032302131311 |
11 | 2a212616712461 |
12 | b3b88a1691127 |
13 | 444b3c7716b45 |
14 | 1ad3dbd328955 |
15 | ba3136d02be1 |
hex | 5be36a7ab86f |
101032302131311 has 2 divisors, whose sum is σ = 101032302131312. Its totient is φ = 101032302131310.
The previous prime is 101032302131279. The next prime is 101032302131317. The reversal of 101032302131311 is 113131203230101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101032302131311 - 25 = 101032302131279 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101032302131317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50516151065655 + 50516151065656.
It is an arithmetic number, because the mean of its divisors is an integer number (50516151065656).
Almost surely, 2101032302131311 is an apocalyptic number.
101032302131311 is a deficient number, since it is larger than the sum of its proper divisors (1).
101032302131311 is an equidigital number, since it uses as much as digits as its factorization.
101032302131311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 101032302131311 its reverse (113131203230101), we get a palindrome (214163505361412).
The spelling of 101032302131311 in words is "one hundred one trillion, thirty-two billion, three hundred two million, one hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •