Base | Representation |
---|---|
bin | 1000001001011101… |
… | …0001101110000000 |
3 | 12122102111020000000 |
4 | 2002113101232000 |
5 | 13434401434333 |
6 | 1001010000000 |
7 | 105125245236 |
oct | 20227215600 |
9 | 5572436000 |
10 | 2187139968 |
11 | a226466a2 |
12 | 510576000 |
13 | 28b17b080 |
14 | 16a690956 |
15 | cc02b713 |
hex | 825d1b80 |
2187139968 has 256 divisors, whose sum is σ = 7049179200. Its totient is φ = 671846400.
The previous prime is 2187139963. The next prime is 2187139979. The reversal of 2187139968 is 8699317812.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2187139963) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3638868 + ... + 3639468.
Almost surely, 22187139968 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 2187139968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3524589600).
2187139968 is an abundant number, since it is smaller than the sum of its proper divisors (4862039232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2187139968 is an frugal number, since it uses more digits than its factorization.
2187139968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 649 (or 619 counting only the distinct ones).
The product of its digits is 1306368, while the sum is 54.
The square root of 2187139968 is about 46766.8682723143. The cubic root of 2187139968 is about 1298.0523038777.
It can be divided in two parts, 2187 and 139968, that multiplied together give a square (306110016 = 174962).
The spelling of 2187139968 in words is "two billion, one hundred eighty-seven million, one hundred thirty-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •