Base | Representation |
---|---|
bin | 1011101101001111001… |
… | …1100101010000001010 |
3 | 201020010112112201000212 |
4 | 2323103303211100022 |
5 | 11243344213310442 |
6 | 232221050401122 |
7 | 20346663610355 |
oct | 2732363452012 |
9 | 636115481025 |
10 | 201122010122 |
11 | 78328149aa0 |
12 | 32b8b4301a2 |
13 | 15c729081a7 |
14 | 9a3d10d29c |
15 | 5371c06a82 |
hex | 2ed3ce540a |
201122010122 has 16 divisors (see below), whose sum is σ = 330813977472. Its totient is φ = 90945419520.
The previous prime is 201122010097. The next prime is 201122010127. The reversal of 201122010122 is 221010221102.
201122010122 is digitally balanced in base 2, 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 = 201122010097 and 201122010106.
It is not an unprimeable number, because it can be changed into a prime (201122010127) 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, 23679458 + ... + 23687949.
It is an arithmetic number, because the mean of its divisors is an integer number (20675873592).
Almost surely, 2201122010122 is an apocalyptic number.
201122010122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201122010122 is a deficient number, since it is larger than the sum of its proper divisors (129691967350).
201122010122 is a wasteful number, since it uses less digits than its factorization.
201122010122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47367613.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201122010122 its reverse (221010221102), we get a palindrome (422132231224).
The spelling of 201122010122 in words is "two hundred one billion, one hundred twenty-two million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •