Base | Representation |
---|---|
bin | 10111000010011010110100… |
… | …110101000011101100110111 |
3 | 111021202020000110120000210120 |
4 | 113002122310311003230313 |
5 | 101240022021423222221 |
6 | 555254211315223023 |
7 | 30225136400433366 |
oct | 2702326465035467 |
9 | 437666013500716 |
10 | 101321312320311 |
11 | 2a314144400026 |
12 | b4448ba5a7a73 |
13 | 446c7357779b5 |
14 | 1b03d98a8d7dd |
15 | baa8ee7865c6 |
hex | 5c26b4d43b37 |
101321312320311 has 16 divisors (see below), whose sum is σ = 135127853752320. Its totient is φ = 67531158151520.
The previous prime is 101321312320309. The next prime is 101321312320313. The reversal of 101321312320311 is 113023213123101.
It is an interprime number because it is at equal distance from previous prime (101321312320309) and next prime (101321312320313).
It is a cyclic number.
It is not a de Polignac number, because 101321312320311 - 21 = 101321312320309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101321312320313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 217166221 + ... + 217632281.
It is an arithmetic number, because the mean of its divisors is an integer number (8445490859520).
Almost surely, 2101321312320311 is an apocalyptic number.
101321312320311 is a deficient number, since it is larger than the sum of its proper divisors (33806541432009).
101321312320311 is a wasteful number, since it uses less digits than its factorization.
101321312320311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483486.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 101321312320311 its reverse (113023213123101), we get a palindrome (214344525443412).
The spelling of 101321312320311 in words is "one hundred one trillion, three hundred twenty-one billion, three hundred twelve million, three hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •