Base | Representation |
---|---|
bin | 1010000110010010010100… |
… | …0000010100011111111010 |
3 | 1110022110001220202111022201 |
4 | 2201210211000110133322 |
5 | 2423403132443113424 |
6 | 35340410544340414 |
7 | 2224113306605500 |
oct | 241444500243772 |
9 | 43273056674281 |
10 | 11103111301114 |
11 | 35a0891965648 |
12 | 12b3a3561470a |
13 | 6270326b7671 |
14 | 2a55718d2670 |
15 | 143c3db20d44 |
hex | a19250147fa |
11103111301114 has 96 divisors (see below), whose sum is σ = 20926116080640. Its totient is φ = 4391196818400.
The previous prime is 11103111301063. The next prime is 11103111301129. The reversal of 11103111301114 is 41110311130111.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 11103111301091 and 11103111301100.
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 in 47 ways as a sum of consecutive naturals, for example, 18164809 + ... + 18766099.
It is an arithmetic number, because the mean of its divisors is an integer number (217980375840).
Almost surely, 211103111301114 is an apocalyptic number.
11103111301114 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11103111301114 is a deficient number, since it is larger than the sum of its proper divisors (9823004779526).
11103111301114 is a wasteful number, since it uses less digits than its factorization.
11103111301114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601584 (or 601577 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 19.
Adding to 11103111301114 its reverse (41110311130111), we get a palindrome (52213422431225).
The spelling of 11103111301114 in words is "eleven trillion, one hundred three billion, one hundred eleven million, three hundred one thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •