Base | Representation |
---|---|
bin | 101111110010110101111000… |
… | …110011100000010011100001 |
3 | 1000120021010011021101122120222 |
4 | 233302311320303200103201 |
5 | 210022422214411413441 |
6 | 2023021250410012425 |
7 | 62163411016601555 |
oct | 5762657063402341 |
9 | 1016233137348528 |
10 | 210202021201121 |
11 | 60a821a4015914 |
12 | 1b6aa687717115 |
13 | 9039c723c4961 |
14 | 39c9b9144b865 |
15 | 1947c84b05d4b |
hex | bf2d78ce04e1 |
210202021201121 has 16 divisors (see below), whose sum is σ = 215980687802880. Its totient is φ = 204454464453120.
The previous prime is 210202021201087. The next prime is 210202021201181. The reversal of 210202021201121 is 121102120202012.
It is a cyclic number.
It is not a de Polignac number, because 210202021201121 - 218 = 210202020938977 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 210202021201121.
It is not an unprimeable number, because it can be changed into a prime (210202021201181) 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, 236642600 + ... + 237529206.
It is an arithmetic number, because the mean of its divisors is an integer number (13498792987680).
Almost surely, 2210202021201121 is an apocalyptic number.
It is an amenable number.
210202021201121 is a deficient number, since it is larger than the sum of its proper divisors (5778666601759).
210202021201121 is a wasteful number, since it uses less digits than its factorization.
210202021201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 904144.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 210202021201121 its reverse (121102120202012), we get a palindrome (331304141403133).
The spelling of 210202021201121 in words is "two hundred ten trillion, two hundred two billion, twenty-one million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •