Base | Representation |
---|---|
bin | 1001101100001101000000… |
… | …01011000100000100111101 |
3 | 2210110012212221020012222112 |
4 | 10312012200023010010331 |
5 | 10243120410110312201 |
6 | 113153404341223405 |
7 | 4326412106256311 |
oct | 466064013040475 |
9 | 83405787205875 |
10 | 21310020010301 |
11 | 687658a821280 |
12 | 2482036701b65 |
13 | bb76ac283649 |
14 | 5395a6497b41 |
15 | 26e4c87bd0bb |
hex | 1361a02c413d |
21310020010301 has 8 divisors (see below), whose sum is σ = 23377167712800. Its totient is φ = 19264517833840.
The previous prime is 21310020010267. The next prime is 21310020010441. The reversal of 21310020010301 is 10301002001312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21310020010301 is a prime.
It is a super-2 number, since 2×213100200103012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21310020010001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5411379446 + ... + 5411383383.
It is an arithmetic number, because the mean of its divisors is an integer number (2922145964100).
Almost surely, 221310020010301 is an apocalyptic number.
It is an amenable number.
21310020010301 is a deficient number, since it is larger than the sum of its proper divisors (2067147702499).
21310020010301 is a wasteful number, since it uses less digits than its factorization.
21310020010301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10822763019.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 21310020010301 its reverse (10301002001312), we get a palindrome (31611022011613).
The spelling of 21310020010301 in words is "twenty-one trillion, three hundred ten billion, twenty million, ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •