Base | Representation |
---|---|
bin | 1010001001000100111010… |
… | …1001000111100010011010 |
3 | 1110111000211011100110001011 |
4 | 2202101032221013202122 |
5 | 2430144324423031132 |
6 | 35414420153444134 |
7 | 2230431345233500 |
oct | 242211651074232 |
9 | 43430734313034 |
10 | 11151054502042 |
11 | 360a154617054 |
12 | 130119571064a |
13 | 62b7032b4000 |
14 | 2a79dcdc0670 |
15 | 1450e7b33b47 |
hex | a244ea4789a |
11151054502042 has 96 divisors (see below), whose sum is σ = 21091103611200. Its totient is φ = 4408699198176.
The previous prime is 11151054502039. The next prime is 11151054502051. The reversal of 11151054502042 is 24020545015111.
It is a super-2 number, since 2×111510545020422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11151054501995 and 11151054502013.
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, 370957209 + ... + 370987267.
It is an arithmetic number, because the mean of its divisors is an integer number (219698995950).
Almost surely, 211151054502042 is an apocalyptic number.
11151054502042 is a deficient number, since it is larger than the sum of its proper divisors (9940049109158).
11151054502042 is a wasteful number, since it uses less digits than its factorization.
11151054502042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31837 (or 31804 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 31.
Adding to 11151054502042 its reverse (24020545015111), we get a palindrome (35171599517153).
The spelling of 11151054502042 in words is "eleven trillion, one hundred fifty-one billion, fifty-four million, five hundred two thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •