Base | Representation |
---|---|
bin | 1001001111110010… |
… | …0000100101000100 |
3 | 20101222112101201001 |
4 | 2103330200211010 |
5 | 20040410102321 |
6 | 1050144143044 |
7 | 115336416400 |
oct | 22374404504 |
9 | 6358471631 |
10 | 2482112836 |
11 | 10640a7125 |
12 | 593307a84 |
13 | 307308928 |
14 | 197916100 |
15 | e7d95c91 |
hex | 93f20944 |
2482112836 has 72 divisors (see below), whose sum is σ = 5232224256. Its totient is φ = 1026224640.
The previous prime is 2482112833. The next prime is 2482112851. The reversal of 2482112836 is 6382112842.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2482112795 and 2482112804.
It is not an unprimeable number, because it can be changed into a prime (2482112833) 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 23 ways as a sum of consecutive naturals, for example, 3687796 + ... + 3688468.
Almost surely, 22482112836 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2482112836, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2616112128).
2482112836 is an abundant number, since it is smaller than the sum of its proper divisors (2750111420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2482112836 is a wasteful number, since it uses less digits than its factorization.
2482112836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1329 (or 1320 counting only the distinct ones).
The product of its digits is 36864, while the sum is 37.
The square root of 2482112836 is about 49820.8072596179. The cubic root of 2482112836 is about 1353.9641754407.
The spelling of 2482112836 in words is "two billion, four hundred eighty-two million, one hundred twelve thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •