Base | Representation |
---|---|
bin | 111111000100110… |
… | …1010100111001100 |
3 | 12110111111110111110 |
4 | 1332021222213030 |
5 | 13313303304202 |
6 | 550003052020 |
7 | 103306432134 |
oct | 17611524714 |
9 | 5414443443 |
10 | 2116463052 |
11 | 996763020 |
12 | 4b0971010 |
13 | 279633402 |
14 | 161133ac4 |
15 | c5c1a26c |
hex | 7e26a9cc |
2116463052 has 24 divisors (see below), whose sum is σ = 5387360832. Its totient is φ = 641352400.
The previous prime is 2116463051. The next prime is 2116463071. The reversal of 2116463052 is 2503646112.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (2116463051) 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 7 ways as a sum of consecutive naturals, for example, 8016774 + ... + 8017037.
It is an arithmetic number, because the mean of its divisors is an integer number (224473368).
Almost surely, 22116463052 is an apocalyptic number.
2116463052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2116463052 is an abundant number, since it is smaller than the sum of its proper divisors (3270897780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2116463052 is a wasteful number, since it uses less digits than its factorization.
2116463052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16033829 (or 16033827 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 2116463052 is about 46005.0328985862. The cubic root of 2116463052 is about 1283.9168456742.
The spelling of 2116463052 in words is "two billion, one hundred sixteen million, four hundred sixty-three thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •