Base | Representation |
---|---|
bin | 10100100001101100… |
… | …00000011000101000 |
3 | 1001110000002120020100 |
4 | 22100312000120220 |
5 | 140032110323143 |
6 | 5021301025400 |
7 | 540041356044 |
oct | 122066003050 |
9 | 31400076210 |
10 | 11020011048 |
11 | 4745566452 |
12 | 21766b5260 |
13 | 1068112ac7 |
14 | 7677dd024 |
15 | 4476e36d3 |
hex | 290d80628 |
11020011048 has 48 divisors (see below), whose sum is σ = 31601505780. Its totient is φ = 3457257984.
The previous prime is 11020011019. The next prime is 11020011053. The reversal of 11020011048 is 84011002011.
It can be written as a sum of positive squares in 2 ways, for example, as 10181213604 + 838797444 = 100902^2 + 28962^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a self number, because there is not a number n which added to its sum of digits gives 11020011048.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4500415 + ... + 4502862.
Almost surely, 211020011048 is an apocalyptic number.
11020011048 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11020011048 is an abundant number, since it is smaller than the sum of its proper divisors (20581494732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020011048 is a wasteful number, since it uses less digits than its factorization.
11020011048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9003306 (or 9003299 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11020011048 its reverse (84011002011), we get a palindrome (95031013059).
The spelling of 11020011048 in words is "eleven billion, twenty million, eleven thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •