Base | Representation |
---|---|
bin | 1010000110101110010111… |
… | …1100011010000100010011 |
3 | 1110100011111211102220101122 |
4 | 2201223211330122010103 |
5 | 2424014044132322311 |
6 | 35344054204152455 |
7 | 2224501045225520 |
oct | 241534574320423 |
9 | 43304454386348 |
10 | 11110643245331 |
11 | 35a3aa7504833 |
12 | 12b5397b3872b |
13 | 627962c7b5a6 |
14 | 2a5a87d5c147 |
15 | 14402eeb30db |
hex | a1ae5f1a113 |
11110643245331 has 16 divisors (see below), whose sum is σ = 13213400851200. Its totient is φ = 9144273968928.
The previous prime is 11110643245297. The next prime is 11110643245357. The reversal of 11110643245331 is 13354234601111.
It is a happy number.
It is not a de Polignac number, because 11110643245331 - 222 = 11110639051027 is a prime.
It is a super-2 number, since 2×111106432453312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11110643245291 and 11110643245300.
It is not an unprimeable number, because it can be changed into a prime (11110643245931) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 312799496 + ... + 312835013.
It is an arithmetic number, because the mean of its divisors is an integer number (825837553200).
Almost surely, 211110643245331 is an apocalyptic number.
11110643245331 is a deficient number, since it is larger than the sum of its proper divisors (2102757605869).
11110643245331 is an equidigital number, since it uses as much as digits as its factorization.
11110643245331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625634618.
The product of its (nonzero) digits is 25920, while the sum is 35.
Adding to 11110643245331 its reverse (13354234601111), we get a palindrome (24464877846442).
The spelling of 11110643245331 in words is "eleven trillion, one hundred ten billion, six hundred forty-three million, two hundred forty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •