Base | Representation |
---|---|
bin | 11001011110000110110001… |
… | …100100001110010111000011 |
3 | 112200122000020212122102002120 |
4 | 121132012301210032113003 |
5 | 104140314000401011321 |
6 | 1034125142014415323 |
7 | 32411115356613414 |
oct | 3136066144162703 |
9 | 480560225572076 |
10 | 112020021110211 |
11 | 32769473619455 |
12 | 10692292501543 |
13 | 4a6759a6c1cb6 |
14 | 1d93b2580d80b |
15 | ce3d7022aec6 |
hex | 65e1b190e5c3 |
112020021110211 has 8 divisors (see below), whose sum is σ = 158145912155664. Its totient is φ = 70287072069120.
The previous prime is 112020021110197. The next prime is 112020021110213. The reversal of 112020021110211 is 112011120020211.
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 112020021110211 - 210 = 112020021109187 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112020021110213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1098235501030 + ... + 1098235501131.
It is an arithmetic number, because the mean of its divisors is an integer number (19768239019458).
Almost surely, 2112020021110211 is an apocalyptic number.
112020021110211 is a deficient number, since it is larger than the sum of its proper divisors (46125891045453).
112020021110211 is a wasteful number, since it uses less digits than its factorization.
112020021110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2196471002181.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112020021110211 its reverse (112011120020211), we get a palindrome (224031141130422).
The spelling of 112020021110211 in words is "one hundred twelve trillion, twenty billion, twenty-one million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •