Base | Representation |
---|---|
bin | 10000001001111000111… |
… | …110111010100010110101 |
3 | 10221010102221221012102100 |
4 | 100021320332322202311 |
5 | 121142022104233023 |
6 | 2205553130532313 |
7 | 143130042351411 |
oct | 20117076724265 |
9 | 3833387835370 |
10 | 1110131321013 |
11 | 39889320a470 |
12 | 15b198897099 |
13 | 808b9a54590 |
14 | 3ba32c51d41 |
15 | 1dd2514dc43 |
hex | 10278fba8b5 |
1110131321013 has 48 divisors (see below), whose sum is σ = 1885240296576. Its totient is φ = 620597185920.
The previous prime is 1110131320999. The next prime is 1110131321041. The reversal of 1110131321013 is 3101231310111.
It is not a de Polignac number, because 1110131321013 - 220 = 1110130272437 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110131321213) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1443831 + ... + 2074827.
It is an arithmetic number, because the mean of its divisors is an integer number (39275839512).
Almost surely, 21110131321013 is an apocalyptic number.
1110131321013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1110131321013 is a deficient number, since it is larger than the sum of its proper divisors (775108975563).
1110131321013 is a wasteful number, since it uses less digits than its factorization.
1110131321013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632394 (or 632391 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 1110131321013 its reverse (3101231310111), we get a palindrome (4211362631124).
The spelling of 1110131321013 in words is "one trillion, one hundred ten billion, one hundred thirty-one million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •