Base | Representation |
---|---|
bin | 1010000110110100101000… |
… | …0100001111100101001100 |
3 | 1110100022211220020100121012 |
4 | 2201231022010033211030 |
5 | 2424031014143134012 |
6 | 35344533011424352 |
7 | 2224560503126204 |
oct | 241551204174514 |
9 | 43308756210535 |
10 | 11112323021132 |
11 | 35a47897141a3 |
12 | 12b57865b50b8 |
13 | 627b6cc96678 |
14 | 2a5ba709b404 |
15 | 1440cc6be622 |
hex | a1b4a10f94c |
11112323021132 has 6 divisors (see below), whose sum is σ = 19446565286988. Its totient is φ = 5556161510564.
The previous prime is 11112323021099. The next prime is 11112323021161. The reversal of 11112323021132 is 23112032321111.
It is a happy number.
It is a super-2 number, since 2×111123230211322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11112323021098 and 11112323021107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1389040377638 + ... + 1389040377645.
It is an arithmetic number, because the mean of its divisors is an integer number (3241094214498).
Almost surely, 211112323021132 is an apocalyptic number.
It is an amenable number.
11112323021132 is a deficient number, since it is larger than the sum of its proper divisors (8334242265856).
11112323021132 is a wasteful number, since it uses less digits than its factorization.
11112323021132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2778080755287 (or 2778080755285 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11112323021132 its reverse (23112032321111), we get a palindrome (34224355342243).
The spelling of 11112323021132 in words is "eleven trillion, one hundred twelve billion, three hundred twenty-three million, twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •