Base | Representation |
---|---|
bin | 11110110011000011011… |
… | …001110111101111101001 |
3 | 21111022210201012202110200 |
4 | 132303003121313233221 |
5 | 234133342433424211 |
6 | 4300132313102413 |
7 | 305622264202410 |
oct | 36630331675751 |
9 | 7438721182420 |
10 | 2116402248681 |
11 | 746619993106 |
12 | 2a220a9b7a09 |
13 | 124764277cb6 |
14 | 74612070477 |
15 | 3a0bc1b7b56 |
hex | 1ecc3677be9 |
2116402248681 has 48 divisors (see below), whose sum is σ = 3580371849600. Its totient is φ = 1179409271040.
The previous prime is 2116402248677. The next prime is 2116402248689. The reversal of 2116402248681 is 1868422046112.
2116402248681 is a `hidden beast` number, since 2 + 1 + 164 + 0 + 2 + 2 + 486 + 8 + 1 = 666.
It is not a de Polignac number, because 2116402248681 - 22 = 2116402248677 is a prime.
It is a super-2 number, since 2×21164022486812 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2116402248689) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6423346 + ... + 6744788.
It is an arithmetic number, because the mean of its divisors is an integer number (74591080200).
Almost surely, 22116402248681 is an apocalyptic number.
2116402248681 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2116402248681 is a deficient number, since it is larger than the sum of its proper divisors (1463969600919).
2116402248681 is a wasteful number, since it uses less digits than its factorization.
2116402248681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324046 (or 324043 counting only the distinct ones).
The product of its (nonzero) digits is 294912, while the sum is 45.
The spelling of 2116402248681 in words is "two trillion, one hundred sixteen billion, four hundred two million, two hundred forty-eight thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •