Base | Representation |
---|---|
bin | 101000000001000111001… |
… | …001011010110111100101 |
3 | 100201220011022211111202011 |
4 | 220001013021122313211 |
5 | 330023421004034000 |
6 | 5503153043114221 |
7 | 402451613311060 |
oct | 50010711326745 |
9 | 10656138744664 |
10 | 2749972721125 |
11 | 970290a00503 |
12 | 384b68372971 |
13 | 16c423c0c786 |
14 | 97156a238d7 |
15 | 4b7ee33c2ba |
hex | 2804725ade5 |
2749972721125 has 64 divisors (see below), whose sum is σ = 4156026900480. Its totient is φ = 1774616040000.
The previous prime is 2749972721099. The next prime is 2749972721143. The reversal of 2749972721125 is 5211272799472.
It is a happy number.
It is not a de Polignac number, because 2749972721125 - 213 = 2749972712933 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2749972721125.
It is a congruent number.
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 63 ways as a sum of consecutive naturals, for example, 1962654 + ... + 3058096.
It is an arithmetic number, because the mean of its divisors is an integer number (64937920320).
Almost surely, 22749972721125 is an apocalyptic number.
2749972721125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2749972721125 is a deficient number, since it is larger than the sum of its proper divisors (1406054179355).
2749972721125 is a wasteful number, since it uses less digits than its factorization.
2749972721125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1095635 (or 1095625 counting only the distinct ones).
The product of its digits is 8890560, while the sum is 58.
The spelling of 2749972721125 in words is "two trillion, seven hundred forty-nine billion, nine hundred seventy-two million, seven hundred twenty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •