Base | Representation |
---|---|
bin | 11001011101111111010011… |
… | …011111010001000010010001 |
3 | 112200121020112220002002121012 |
4 | 121131333103133101002101 |
5 | 104140201034034114301 |
6 | 1034121334052540305 |
7 | 32410412534064530 |
oct | 3135772337210221 |
9 | 480536486062535 |
10 | 112012000301201 |
11 | 32766028028980 |
12 | 10690814321695 |
13 | 4a668bca74470 |
14 | 1d935a448a317 |
15 | ce3a50ebeebb |
hex | 65dfd37d1091 |
112012000301201 has 16 divisors (see below), whose sum is σ = 150393734671488. Its totient is φ = 80568072144000.
The previous prime is 112012000301197. The next prime is 112012000301231. The reversal of 112012000301201 is 102103000210211.
It is not a de Polignac number, because 112012000301201 - 22 = 112012000301197 is a prime.
It is a super-2 number, since 2×1120120003012012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112012000301231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55950049100 + ... + 55950051101.
It is an arithmetic number, because the mean of its divisors is an integer number (9399608416968).
Almost surely, 2112012000301201 is an apocalyptic number.
112012000301201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112012000301201 is a deficient number, since it is larger than the sum of its proper divisors (38381734370287).
112012000301201 is a wasteful number, since it uses less digits than its factorization.
112012000301201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111900100232.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 112012000301201 its reverse (102103000210211), we get a palindrome (214115000511412).
The spelling of 112012000301201 in words is "one hundred twelve trillion, twelve billion, three hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •