Base | Representation |
---|---|
bin | 1010000111010010000101… |
… | …1010110101011111100011 |
3 | 1110101002021000111221010211 |
4 | 2201310201122311133203 |
5 | 2424143213114343243 |
6 | 35352321423234551 |
7 | 2225260456006126 |
oct | 241644132653743 |
9 | 43332230457124 |
10 | 11120231012323 |
11 | 35a8077559004 |
12 | 12b7212a48a57 |
13 | 6288304333b4 |
14 | 2a63174543bd |
15 | 1443e1a92d9d |
hex | a1d216b57e3 |
11120231012323 has 16 divisors (see below), whose sum is σ = 11862375829920. Its totient is φ = 10388119092736.
The previous prime is 11120231012239. The next prime is 11120231012353. The reversal of 11120231012323 is 32321013202111.
It is a cyclic number.
It is not a de Polignac number, because 11120231012323 - 213 = 11120231004131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11120231012294 and 11120231012303.
It is not an unprimeable number, because it can be changed into a prime (11120231012353) 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 15 ways as a sum of consecutive naturals, for example, 2559136 + ... + 5365597.
It is an arithmetic number, because the mean of its divisors is an integer number (741398489370).
Almost surely, 211120231012323 is an apocalyptic number.
11120231012323 is a deficient number, since it is larger than the sum of its proper divisors (742144817597).
11120231012323 is a wasteful number, since it uses less digits than its factorization.
11120231012323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7925366.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11120231012323 its reverse (32321013202111), we get a palindrome (43441244214434).
The spelling of 11120231012323 in words is "eleven trillion, one hundred twenty billion, two hundred thirty-one million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •