Base | Representation |
---|---|
bin | 100111110111000000101… |
… | …100000101011100110000 |
3 | 100200212011110121020022110 |
4 | 213313000230011130300 |
5 | 324334212444342210 |
6 | 5454200524405320 |
7 | 401616055626132 |
oct | 47670054053460 |
9 | 10625143536273 |
10 | 2739126949680 |
11 | 966725832930 |
12 | 382a400a6840 |
13 | 16b3b5c34934 |
14 | 9680841d052 |
15 | 4b3b70b5420 |
hex | 27dc0b05730 |
2739126949680 has 160 divisors (see below), whose sum is σ = 9438007714560. Its totient is φ = 651501859840.
The previous prime is 2739126949639. The next prime is 2739126949697. The reversal of 2739126949680 is 869496219372.
It is a super-2 number, since 2×27391269496802 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9648270 + ... + 9928109.
It is an arithmetic number, because the mean of its divisors is an integer number (58987548216).
Almost surely, 22739126949680 is an apocalyptic number.
2739126949680 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2739126949680 is an abundant number, since it is smaller than the sum of its proper divisors (6698880764880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2739126949680 is a wasteful number, since it uses less digits than its factorization.
2739126949680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19576459 (or 19576453 counting only the distinct ones).
The product of its (nonzero) digits is 70543872, while the sum is 66.
The spelling of 2739126949680 in words is "two trillion, seven hundred thirty-nine billion, one hundred twenty-six million, nine hundred forty-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •