Base | Representation |
---|---|
bin | 11001010001001001111111… |
… | …100001001011110001110100 |
3 | 112120110221021100202210012121 |
4 | 121101021333201023301310 |
5 | 104031223443021102012 |
6 | 1032204250202325324 |
7 | 32256613023434260 |
oct | 3121117741136164 |
9 | 476427240683177 |
10 | 111130123222132 |
11 | 32456025447893 |
12 | 105699194b9844 |
13 | 4a016aab26211 |
14 | 1d62a25d6b0a0 |
15 | ccab39a2ca07 |
hex | 65127f84bc74 |
111130123222132 has 12 divisors (see below), whose sum is σ = 222260246444320. Its totient is φ = 47627195666616.
The previous prime is 111130123222127. The next prime is 111130123222133. The reversal of 111130123222132 is 231222321031111.
111130123222132 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 111130123222097 and 111130123222106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111130123222133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1984466486082 + ... + 1984466486137.
Almost surely, 2111130123222132 is an apocalyptic number.
It is an amenable number.
111130123222132 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111130123222132 is a wasteful number, since it uses less digits than its factorization.
111130123222132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3968932972230 (or 3968932972228 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 111130123222132 its reverse (231222321031111), we get a palindrome (342352444253243).
The spelling of 111130123222132 in words is "one hundred eleven trillion, one hundred thirty billion, one hundred twenty-three million, two hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •