Base | Representation |
---|---|
bin | 1011101101001111000… |
… | …0001100011101000000 |
3 | 201020010110212120220121 |
4 | 2323103300030131000 |
5 | 11243344001401422 |
6 | 232221015350024 |
7 | 20346653221411 |
oct | 2732360143500 |
9 | 636113776817 |
10 | 201121122112 |
11 | 783276a28a9 |
12 | 32b8b082314 |
13 | 15c72686c41 |
14 | 9a3cd5b808 |
15 | 5371acd8c7 |
hex | 2ed3c0c740 |
201121122112 has 14 divisors (see below), whose sum is σ = 399099726818. Its totient is φ = 100560561024.
The previous prime is 201121122101. The next prime is 201121122119. The reversal of 201121122112 is 211221121102.
201121122112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 187475144256 + 13645977856 = 432984^2 + 116816^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201121122119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1571258703 + ... + 1571258830.
Almost surely, 2201121122112 is an apocalyptic number.
It is an amenable number.
201121122112 is a deficient number, since it is larger than the sum of its proper divisors (197978604706).
201121122112 is an equidigital number, since it uses as much as digits as its factorization.
201121122112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3142517545 (or 3142517535 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201121122112 its reverse (211221121102), we get a palindrome (412342243214).
The spelling of 201121122112 in words is "two hundred one billion, one hundred twenty-one million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •