Base | Representation |
---|---|
bin | 10100100110001111… |
… | …10000101000010000 |
3 | 1001112122222202102112 |
4 | 22103013300220100 |
5 | 140121401011121 |
6 | 5025144004452 |
7 | 541014213050 |
oct | 122307605020 |
9 | 31478882375 |
10 | 11058219536 |
11 | 4765093011 |
12 | 2187460728 |
13 | 1073000090 |
14 | 76c907560 |
15 | 44ac3e75b |
hex | 2931f0a10 |
11058219536 has 80 divisors (see below), whose sum is σ = 26455473408. Its totient is φ = 4360435200.
The previous prime is 11058219533. The next prime is 11058219581. The reversal of 11058219536 is 63591285011.
It is a junction number, because it is equal to n+sod(n) for n = 11058219493 and 11058219502.
It is not an unprimeable number, because it can be changed into a prime (11058219533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 440606 + ... + 465026.
Almost surely, 211058219536 is an apocalyptic number.
11058219536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11058219536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13227736704).
11058219536 is an abundant number, since it is smaller than the sum of its proper divisors (15397253872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11058219536 is a wasteful number, since it uses less digits than its factorization.
11058219536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24760 (or 24754 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 41.
The spelling of 11058219536 in words is "eleven billion, fifty-eight million, two hundred nineteen thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •