Base | Representation |
---|---|
bin | 11001011101111110100100… |
… | …011100101111011100111010 |
3 | 112200121011111220002001001221 |
4 | 121131332210130233130322 |
5 | 104140142430021011302 |
6 | 1034121123501502254 |
7 | 32410354142060245 |
oct | 3135764434573472 |
9 | 480534456061057 |
10 | 112011211110202 |
11 | 32765762600008 |
12 | 10690633b7198a |
13 | 4a667c5407441 |
14 | 1d9352b73625c |
15 | ce3a06a80937 |
hex | 65dfa472f73a |
112011211110202 has 4 divisors (see below), whose sum is σ = 168016816665306. Its totient is φ = 56005605555100.
The previous prime is 112011211110163. The next prime is 112011211110209. The reversal of 112011211110202 is 202011112110211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 69427873210921 + 42583337899281 = 8332339^2 + 6525591^2 .
It is a super-2 number, since 2×1120112111102022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112011211110209) 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 as a sum of consecutive naturals, namely, 28002802777549 + ... + 28002802777552.
Almost surely, 2112011211110202 is an apocalyptic number.
112011211110202 is a deficient number, since it is larger than the sum of its proper divisors (56005605555104).
112011211110202 is an equidigital number, since it uses as much as digits as its factorization.
112011211110202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56005605555103.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112011211110202 its reverse (202011112110211), we get a palindrome (314022323220413).
The spelling of 112011211110202 in words is "one hundred twelve trillion, eleven billion, two hundred eleven million, one hundred ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.341 sec. • engine limits •