Base | Representation |
---|---|
bin | 1001101001000000000111… |
… | …01110111010000100110001 |
3 | 2210001200221221001202012212 |
4 | 10310200003232322010301 |
5 | 10234320120411414301 |
6 | 113031053313101505 |
7 | 4315436200646003 |
oct | 464400356720461 |
9 | 83050857052185 |
10 | 21200021201201 |
11 | 6833973314987 |
12 | 2464858257895 |
13 | baa1cc0b281b |
14 | 53412d504373 |
15 | 26b6db85d4bb |
hex | 134803bba131 |
21200021201201 has 8 divisors (see below), whose sum is σ = 21223540804704. Its totient is φ = 21176505322560.
The previous prime is 21200021201159. The next prime is 21200021201231. The reversal of 21200021201201 is 10210212000212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21200021201201 - 26 = 21200021201137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21200021201231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10536326 + ... + 12386048.
It is an arithmetic number, because the mean of its divisors is an integer number (2652942600588).
Almost surely, 221200021201201 is an apocalyptic number.
It is an amenable number.
21200021201201 is a deficient number, since it is larger than the sum of its proper divisors (23519603503).
21200021201201 is a wasteful number, since it uses less digits than its factorization.
21200021201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1862431.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21200021201201 its reverse (10210212000212), we get a palindrome (31410233201413).
The spelling of 21200021201201 in words is "twenty-one trillion, two hundred billion, twenty-one million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •