Base | Representation |
---|---|
bin | 100001010010011… |
… | …0101100100001000 |
3 | 2212211202002020201 |
4 | 1002210311210020 |
5 | 4241414442330 |
6 | 302500101544 |
7 | 36451641163 |
oct | 10244654410 |
9 | 2784662221 |
10 | 1116952840 |
11 | 523544223 |
12 | 2720948b4 |
13 | 14a538153 |
14 | a84b2ada |
15 | 680d3eca |
hex | 42935908 |
1116952840 has 64 divisors (see below), whose sum is σ = 2541196800. Its totient is φ = 441827328.
The previous prime is 1116952831. The next prime is 1116952871. The reversal of 1116952840 is 482596111.
It is a self number, because there is not a number n which added to its sum of digits gives 1116952840.
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 15 ways as a sum of consecutive naturals, for example, 1839817 + ... + 1840423.
It is an arithmetic number, because the mean of its divisors is an integer number (39706200).
Almost surely, 21116952840 is an apocalyptic number.
1116952840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1116952840 is an abundant number, since it is smaller than the sum of its proper divisors (1424243960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116952840 is a wasteful number, since it uses less digits than its factorization.
1116952840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1054 (or 1050 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 37.
The square root of 1116952840 is about 33420.8443938809. The cubic root of 1116952840 is about 1037.5561577964.
It can be divided in two parts, 11169 and 52840, that added together give a square (64009 = 2532).
The spelling of 1116952840 in words is "one billion, one hundred sixteen million, nine hundred fifty-two thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •