Base | Representation |
---|---|
bin | 11001100000101111010100… |
… | …110000010100111110000001 |
3 | 112201021022101121120021022210 |
4 | 121200233110300110332001 |
5 | 104201300122012041001 |
6 | 1034344232230452333 |
7 | 32430153244010223 |
oct | 3140572460247601 |
9 | 481238347507283 |
10 | 112201000112001 |
11 | 328291a4542119 |
12 | 1070137bb040a9 |
13 | 4a7b680100b38 |
14 | 1d9c7b364c413 |
15 | ce8913868dd6 |
hex | 660bd4c14f81 |
112201000112001 has 8 divisors (see below), whose sum is σ = 149738205704320. Its totient is φ = 74732230630512.
The previous prime is 112201000111861. The next prime is 112201000112009. The reversal of 112201000112001 is 100211000102211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112201000112001 - 211 = 112201000109953 is a prime.
It is a super-2 number, since 2×1122010001120012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112201000112009) 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, 17109023881 + ... + 17109030438.
It is an arithmetic number, because the mean of its divisors is an integer number (18717275713040).
Almost surely, 2112201000112001 is an apocalyptic number.
It is an amenable number.
112201000112001 is a deficient number, since it is larger than the sum of its proper divisors (37537205592319).
112201000112001 is a wasteful number, since it uses less digits than its factorization.
112201000112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34218055415.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112201000112001 its reverse (100211000102211), we get a palindrome (212412000214212).
The spelling of 112201000112001 in words is "one hundred twelve trillion, two hundred one billion, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •