Base | Representation |
---|---|
bin | 1001101001000110000010… |
… | …01110001101100100001001 |
3 | 2210002000011111002202201202 |
4 | 10310203001032031210021 |
5 | 10234343123234120241 |
6 | 113032341000153545 |
7 | 4315611032601323 |
oct | 464430116154411 |
9 | 83060144082652 |
10 | 21203200301321 |
11 | 6835254892955 |
12 | 24653a4a688b5 |
13 | baa5b791445c |
14 | 53435180c613 |
15 | 26b8259cdd9b |
hex | 1348c138d909 |
21203200301321 has 8 divisors (see below), whose sum is σ = 21239355000384. Its totient is φ = 21167073194800.
The previous prime is 21203200301293. The next prime is 21203200301329. The reversal of 21203200301321 is 12310300230212.
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-21203200301321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21203200301293 and 21203200301302.
It is not an unprimeable number, because it can be changed into a prime (21203200301329) 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, 5359655 + ... + 8433996.
It is an arithmetic number, because the mean of its divisors is an integer number (2654919375048).
Almost surely, 221203200301321 is an apocalyptic number.
It is an amenable number.
21203200301321 is a deficient number, since it is larger than the sum of its proper divisors (36154699063).
21203200301321 is a wasteful number, since it uses less digits than its factorization.
21203200301321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13796271.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 21203200301321 its reverse (12310300230212), we get a palindrome (33513500531533).
The spelling of 21203200301321 in words is "twenty-one trillion, two hundred three billion, two hundred million, three hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •