Base | Representation |
---|---|
bin | 1010000110010001111010… |
… | …0001010100011011100100 |
3 | 1110022102210100001101110001 |
4 | 2201210132201110123210 |
5 | 2423402422120323301 |
6 | 35340352100511044 |
7 | 2224110516113410 |
oct | 241443641243344 |
9 | 43272710041401 |
10 | 11103002511076 |
11 | 35a0836510023 |
12 | 12b3a050ab484 |
13 | 627015cb6c68 |
14 | 2a5561293d40 |
15 | 143c342d1c01 |
hex | a191e8546e4 |
11103002511076 has 48 divisors (see below), whose sum is σ = 23797739863296. Its totient is φ = 4428526760064.
The previous prime is 11103002511043. The next prime is 11103002511079. The reversal of 11103002511076 is 67011520030111.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (11103002511079) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 232958431 + ... + 233006086.
It is an arithmetic number, because the mean of its divisors is an integer number (495786247152).
Almost surely, 211103002511076 is an apocalyptic number.
It is an amenable number.
11103002511076 is an abundant number, since it is smaller than the sum of its proper divisors (12694737352220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11103002511076 is a wasteful number, since it uses less digits than its factorization.
11103002511076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465964588 (or 465964586 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 28.
Adding to 11103002511076 its reverse (67011520030111), we get a palindrome (78114522541187).
The spelling of 11103002511076 in words is "eleven trillion, one hundred three billion, two million, five hundred eleven thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •