Base | Representation |
---|---|
bin | 100111111010000101000… |
… | …000100101010010101101 |
3 | 100201011200000021220210111 |
4 | 213322011000211102231 |
5 | 324412434142013300 |
6 | 5455503424140021 |
7 | 402063511653256 |
oct | 47720500452255 |
9 | 10634600256714 |
10 | 2742420657325 |
11 | 968065a6a168 |
12 | 3835bb167611 |
13 | 16b7bc422b7b |
14 | 96a3ba3bb2d |
15 | 4b50b3239ba |
hex | 27e850254ad |
2742420657325 has 24 divisors (see below), whose sum is σ = 3526417751168. Its totient is φ = 2113916201280.
The previous prime is 2742420657323. The next prime is 2742420657359. The reversal of 2742420657325 is 5237560242472.
It is not a de Polignac number, because 2742420657325 - 21 = 2742420657323 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2742420657323) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 14296857 + ... + 14487406.
Almost surely, 22742420657325 is an apocalyptic number.
2742420657325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2742420657325 is a deficient number, since it is larger than the sum of its proper divisors (783997093843).
2742420657325 is a wasteful number, since it uses less digits than its factorization.
2742420657325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28784413 (or 28784408 counting only the distinct ones).
The product of its (nonzero) digits is 5644800, while the sum is 49.
Adding to 2742420657325 its reverse (5237560242472), we get a palindrome (7979980899797).
The spelling of 2742420657325 in words is "two trillion, seven hundred forty-two billion, four hundred twenty million, six hundred fifty-seven thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •