Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …0000000001001101111 |
3 | 201020010112202022011122 |
4 | 2323103310000021233 |
5 | 11243344230322203 |
6 | 232221053011155 |
7 | 20346664546526 |
oct | 2732364001157 |
9 | 636115668148 |
10 | 201122120303 |
11 | 78328214855 |
12 | 32b8b483abb |
13 | 15c729463a0 |
14 | 9a3d13b4bd |
15 | 5371c29538 |
hex | 2ed3d0026f |
201122120303 has 64 divisors (see below), whose sum is σ = 237504960000. Its totient is φ = 168626479104.
The previous prime is 201122120263. The next prime is 201122120317. The reversal of 201122120303 is 303021221102.
201122120303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 201122120303 - 26 = 201122120239 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201122120803) 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 63 ways as a sum of consecutive naturals, for example, 395131613 + ... + 395132121.
It is an arithmetic number, because the mean of its divisors is an integer number (3711015000).
Almost surely, 2201122120303 is an apocalyptic number.
201122120303 is a deficient number, since it is larger than the sum of its proper divisors (36382839697).
201122120303 is a wasteful number, since it uses less digits than its factorization.
201122120303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1044.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 201122120303 its reverse (303021221102), we get a palindrome (504143341405).
The spelling of 201122120303 in words is "two hundred one billion, one hundred twenty-two million, one hundred twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •