Base | Representation |
---|---|
bin | 1001101001010011000101… |
… | …00000111110101011000011 |
3 | 2210002200020101202101001201 |
4 | 10310221202200332223003 |
5 | 10240001443014221011 |
6 | 113035455412242031 |
7 | 4316246363353015 |
oct | 464514240765303 |
9 | 83080211671051 |
10 | 21210201320131 |
11 | 6838217772a0a |
12 | 2466819610317 |
13 | bab1621b6035 |
14 | 5348175521b5 |
15 | 26bad5449cc1 |
hex | 134a6283eac3 |
21210201320131 has 16 divisors (see below), whose sum is σ = 22032241989120. Its totient is φ = 20403717647040.
The previous prime is 21210201320089. The next prime is 21210201320159. The reversal of 21210201320131 is 13102310201212.
It is a cyclic number.
It is not a de Polignac number, because 21210201320131 - 211 = 21210201318083 is a prime.
It is a super-2 number, since 2×212102013201312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21210201320099 and 21210201320108.
It is not an unprimeable number, because it can be changed into a prime (21210201320171) 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, 735471 + ... + 6554488.
It is an arithmetic number, because the mean of its divisors is an integer number (1377015124320).
Almost surely, 221210201320131 is an apocalyptic number.
21210201320131 is a deficient number, since it is larger than the sum of its proper divisors (822040668989).
21210201320131 is an equidigital number, since it uses as much as digits as its factorization.
21210201320131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7291026.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 21210201320131 its reverse (13102310201212), we get a palindrome (34312511521343).
The spelling of 21210201320131 in words is "twenty-one trillion, two hundred ten billion, two hundred one million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •