Base | Representation |
---|---|
bin | 100001010010010… |
… | …0011001110111000 |
3 | 2212211121021020200 |
4 | 1002210203032320 |
5 | 4241410042002 |
6 | 302454322200 |
7 | 36451206234 |
oct | 10244431670 |
9 | 2784537220 |
10 | 1116877752 |
11 | 5234a2871 |
12 | 272059360 |
13 | 14a50cc13 |
14 | a84935c4 |
15 | 680bbb1c |
hex | 429233b8 |
1116877752 has 24 divisors (see below), whose sum is σ = 3024877440. Its totient is φ = 372292560.
The previous prime is 1116877733. The next prime is 1116877763. The reversal of 1116877752 is 2577786111.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 1116877698 and 1116877707.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 7756024 + ... + 7756167.
It is an arithmetic number, because the mean of its divisors is an integer number (126036560).
Almost surely, 21116877752 is an apocalyptic number.
1116877752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1116877752 is an abundant number, since it is smaller than the sum of its proper divisors (1907999688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116877752 is a wasteful number, since it uses less digits than its factorization.
1116877752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15512203 (or 15512196 counting only the distinct ones).
The product of its digits is 164640, while the sum is 45.
The square root of 1116877752 is about 33419.7210042214. The cubic root of 1116877752 is about 1037.5329071093.
The spelling of 1116877752 in words is "one billion, one hundred sixteen million, eight hundred seventy-seven thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •