Base | Representation |
---|---|
bin | 1001101011111010100101… |
… | …10000101000101011110011 |
3 | 2210102021100202212210112210 |
4 | 10311331102300220223303 |
5 | 10242440132103132011 |
6 | 113145051212023203 |
7 | 4325612052526323 |
oct | 465752260505363 |
9 | 83367322783483 |
10 | 21300131302131 |
11 | 6872375910490 |
12 | 2480136a61b03 |
13 | bb6794661536 |
14 | 538d09025283 |
15 | 26e0ea5956a6 |
hex | 135f52c28af3 |
21300131302131 has 16 divisors (see below), whose sum is σ = 31256186244480. Its totient is φ = 12794930037120.
The previous prime is 21300131302129. The next prime is 21300131302183. The reversal of 21300131302131 is 13120313100312.
It is a happy number.
It is not a de Polignac number, because 21300131302131 - 21 = 21300131302129 is a prime.
It is a super-2 number, since 2×213001313021312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21300131302098 and 21300131302107.
It is not an unprimeable number, because it can be changed into a prime (21300231302131) 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, 2856007441 + ... + 2856014898.
It is an arithmetic number, because the mean of its divisors is an integer number (1953511640280).
Almost surely, 221300131302131 is an apocalyptic number.
21300131302131 is a deficient number, since it is larger than the sum of its proper divisors (9956054942349).
21300131302131 is a wasteful number, since it uses less digits than its factorization.
21300131302131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5712022466.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 21300131302131 its reverse (13120313100312), we get a palindrome (34420444402443).
The spelling of 21300131302131 in words is "twenty-one trillion, three hundred billion, one hundred thirty-one million, three hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •