Base | Representation |
---|---|
bin | 10100100110010000… |
… | …00101110110110000 |
3 | 1001112200011011200200 |
4 | 22103020011312300 |
5 | 140121411301410 |
6 | 5025145515200 |
7 | 541015024404 |
oct | 122310056660 |
9 | 31480134620 |
10 | 11058306480 |
11 | 4765142371 |
12 | 21874a2b00 |
13 | 1073030820 |
14 | 76c92b104 |
15 | 44ac5a3c0 |
hex | 293205db0 |
11058306480 has 120 divisors (see below), whose sum is σ = 39994242288. Its totient is φ = 2722042368.
The previous prime is 11058306437. The next prime is 11058306521. The reversal of 11058306480 is 8460385011.
11058306480 is a `hidden beast` number, since 1 + 1 + 0 + 5 + 8 + 3 + 0 + 648 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×110583064802 (a number of 21 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 581362 + ... + 600081.
Almost surely, 211058306480 is an apocalyptic number.
11058306480 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11058306480 is an abundant number, since it is smaller than the sum of its proper divisors (28935935808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11058306480 is a wasteful number, since it uses less digits than its factorization.
11058306480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1181475 (or 1181466 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The spelling of 11058306480 in words is "eleven billion, fifty-eight million, three hundred six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •