Base | Representation |
---|---|
bin | 11001011101110101010000… |
… | …111011101011110011110011 |
3 | 112200120012201121001002211210 |
4 | 121131311100323223303303 |
5 | 104140011444310013021 |
6 | 1034112352233411203 |
7 | 32406551433045105 |
oct | 3135652073536363 |
9 | 480505647032753 |
10 | 112001220001011 |
11 | 327614a5908880 |
12 | 1068a705b69b03 |
13 | 4a65892510a03 |
14 | 1d92c60849575 |
15 | ce361e87be76 |
hex | 65dd50eebcf3 |
112001220001011 has 128 divisors (see below), whose sum is σ = 177149547417600. Its totient is φ = 62184800706560.
The previous prime is 112001220000983. The next prime is 112001220001037. The reversal of 112001220001011 is 110100022100211.
It is a cyclic number.
It is not a de Polignac number, because 112001220001011 - 217 = 112001219869939 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112001220001061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3811235860 + ... + 3811265246.
It is an arithmetic number, because the mean of its divisors is an integer number (1383980839200).
Almost surely, 2112001220001011 is an apocalyptic number.
112001220001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112001220001011 is a deficient number, since it is larger than the sum of its proper divisors (65148327416589).
112001220001011 is a wasteful number, since it uses less digits than its factorization.
112001220001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30609.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112001220001011 its reverse (110100022100211), we get a palindrome (222101242101222).
The spelling of 112001220001011 in words is "one hundred twelve trillion, one billion, two hundred twenty million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •