Base | Representation |
---|---|
bin | 101101101101001111011010… |
… | …100000000110000010100010 |
3 | 222100202102101112021100010221 |
4 | 231231033122200012002202 |
5 | 202322012022132413442 |
6 | 1551311440511513254 |
7 | 60225201163655662 |
oct | 5555173240060242 |
9 | 870672345240127 |
10 | 201021020201122 |
11 | 59062599329490 |
12 | 1a667278b2882a |
13 | 882227c3c3344 |
14 | 378d67da3c1a2 |
15 | 1839040de3467 |
hex | b6d3da8060a2 |
201021020201122 has 16 divisors (see below), whose sum is σ = 328943913213600. Its totient is φ = 91373072775040.
The previous prime is 201021020201119. The next prime is 201021020201293. The reversal of 201021020201122 is 221102020120102.
It is a happy number.
201021020201122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 201021020201096 and 201021020201105.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12793629 + ... + 23784847.
It is an arithmetic number, because the mean of its divisors is an integer number (20558994575850).
Almost surely, 2201021020201122 is an apocalyptic number.
201021020201122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201021020201122 is a deficient number, since it is larger than the sum of its proper divisors (127922893012478).
201021020201122 is a wasteful number, since it uses less digits than its factorization.
201021020201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11822561.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201021020201122 its reverse (221102020120102), we get a palindrome (422123040321224).
The spelling of 201021020201122 in words is "two hundred one trillion, twenty-one billion, twenty million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •