Base | Representation |
---|---|
bin | 100100000111001011010… |
… | …010110000111000001100 |
3 | 22210020110110001101022222 |
4 | 210013023102300320030 |
5 | 311124312321322221 |
6 | 5140011234354512 |
7 | 344201346650066 |
oct | 44071322607014 |
9 | 8706413041288 |
10 | 2481606823436 |
11 | 8774973a1514 |
12 | 340b5112ba38 |
13 | 150025b8c000 |
14 | 88178d7a736 |
15 | 44843e909ab |
hex | 241cb4b0e0c |
2481606823436 has 96 divisors (see below), whose sum is σ = 5122930008000. Its totient is φ = 1047656623104.
The previous prime is 2481606823433. The next prime is 2481606823469. The reversal of 2481606823436 is 6343286061842.
It is a super-2 number, since 2×24816068234362 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2481606823433) 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 31 ways as a sum of consecutive naturals, for example, 4585940 + ... + 5098436.
It is an arithmetic number, because the mean of its divisors is an integer number (53363854250).
Almost surely, 22481606823436 is an apocalyptic number.
2481606823436 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
2481606823436 is an abundant number, since it is smaller than the sum of its proper divisors (2641323184564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2481606823436 is a wasteful number, since it uses less digits than its factorization.
2481606823436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 512588 (or 512560 counting only the distinct ones).
The product of its (nonzero) digits is 7962624, while the sum is 53.
The spelling of 2481606823436 in words is "two trillion, four hundred eighty-one billion, six hundred six million, eight hundred twenty-three thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •