Base | Representation |
---|---|
bin | 11001010010001100001100… |
… | …101000100100011000100000 |
3 | 112120201201202112111112201201 |
4 | 121102030030220210120200 |
5 | 104033410034304101422 |
6 | 1032301044123410544 |
7 | 32265010440114133 |
oct | 3122141450443040 |
9 | 476651675445651 |
10 | 111201210222112 |
11 | 3248319418504a |
12 | 1057b658383a54 |
13 | 4a082c951c30a |
14 | 1d6624b09a21a |
15 | ccc8ea7a7727 |
hex | 65230ca24620 |
111201210222112 has 24 divisors (see below), whose sum is σ = 230449876448400. Its totient is φ = 52674257473344.
The previous prime is 111201210222077. The next prime is 111201210222149. The reversal of 111201210222112 is 211222012102111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 111201210222112.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91448363062 + ... + 91448364277.
It is an arithmetic number, because the mean of its divisors is an integer number (9602078185350).
Almost surely, 2111201210222112 is an apocalyptic number.
It is an amenable number.
111201210222112 is an abundant number, since it is smaller than the sum of its proper divisors (119248666226288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111201210222112 is a wasteful number, since it uses less digits than its factorization.
111201210222112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182896727368 (or 182896727360 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 111201210222112 its reverse (211222012102111), we get a palindrome (322423222324223).
The spelling of 111201210222112 in words is "one hundred eleven trillion, two hundred one billion, two hundred ten million, two hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •