Base | Representation |
---|---|
bin | 11001011111010010011000… |
… | …111011101001110001001011 |
3 | 112200220202211020000010010120 |
4 | 121133102120323221301023 |
5 | 104143131240310400021 |
6 | 1034230330321314323 |
7 | 32420021353523136 |
oct | 3137223073516113 |
9 | 480822736003116 |
10 | 112101212200011 |
11 | 3279a9478a5971 |
12 | 106a5b711959a3 |
13 | 4a7213951b778 |
14 | 1d97a2883921d |
15 | ce60230752c6 |
hex | 65f498ee9c4b |
112101212200011 has 8 divisors (see below), whose sum is σ = 149741533909824. Its totient is φ = 74597515978440.
The previous prime is 112101212199983. The next prime is 112101212200027. The reversal of 112101212200011 is 110002212101211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112101212200011 - 214 = 112101212183627 is a prime.
It is a super-3 number, since 3×1121012122000113 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (112101212202011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34156370145 + ... + 34156373426.
It is an arithmetic number, because the mean of its divisors is an integer number (18717691738728).
Almost surely, 2112101212200011 is an apocalyptic number.
112101212200011 is a deficient number, since it is larger than the sum of its proper divisors (37640321709813).
112101212200011 is an equidigital number, since it uses as much as digits as its factorization.
112101212200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68312744121.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112101212200011 its reverse (110002212101211), we get a palindrome (222103424301222).
The spelling of 112101212200011 in words is "one hundred twelve trillion, one hundred one billion, two hundred twelve million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •