Base | Representation |
---|---|
bin | 10101011000110110… |
… | …10110101111000000 |
3 | 1002122020220000011020 |
4 | 22230123112233000 |
5 | 142004043134002 |
6 | 5135231545440 |
7 | 554361035253 |
oct | 125433265700 |
9 | 32566800136 |
10 | 11482786752 |
11 | 4962808708 |
12 | 228568b280 |
13 | 110cc63898 |
14 | 7ad06509a |
15 | 4731572bc |
hex | 2ac6d6bc0 |
11482786752 has 28 divisors (see below), whose sum is σ = 30381540456. Its totient is φ = 3827595520.
The previous prime is 11482786751. The next prime is 11482786769. The reversal of 11482786752 is 25768728411.
It is a happy number.
11482786752 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11482786695 and 11482786704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11482786751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29902899 + ... + 29903282.
Almost surely, 211482786752 is an apocalyptic number.
11482786752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11482786752 is an abundant number, since it is smaller than the sum of its proper divisors (18898753704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11482786752 is an equidigital number, since it uses as much as digits as its factorization.
11482786752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59806196 (or 59806186 counting only the distinct ones).
The product of its digits is 1505280, while the sum is 51.
The spelling of 11482786752 in words is "eleven billion, four hundred eighty-two million, seven hundred eighty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •