Base | Representation |
---|---|
bin | 100111111010001010111… |
… | …100000000010110101111 |
3 | 100201011220221110011222002 |
4 | 213322022330000112233 |
5 | 324413140122331001 |
6 | 5455521340042515 |
7 | 402066130252145 |
oct | 47721274002657 |
9 | 10634827404862 |
10 | 2742520120751 |
11 | 968107124544 |
12 | 38362853343b |
13 | 16b806c09378 |
14 | 96a4ad2d595 |
15 | 4b514e1e46b |
hex | 27e8af005af |
2742520120751 has 8 divisors (see below), whose sum is σ = 2750351254560. Its totient is φ = 2734692992608.
The previous prime is 2742520120741. The next prime is 2742520120771. The reversal of 2742520120751 is 1570210252472.
2742520120751 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2742520120751 - 210 = 2742520119727 is a prime.
It is a super-2 number, since 2×27425201207512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2742520120741) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 372545 + ... + 2371461.
It is an arithmetic number, because the mean of its divisors is an integer number (343793906820).
Almost surely, 22742520120751 is an apocalyptic number.
2742520120751 is a deficient number, since it is larger than the sum of its proper divisors (7831133809).
2742520120751 is a wasteful number, since it uses less digits than its factorization.
2742520120751 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2002833.
The product of its (nonzero) digits is 78400, while the sum is 38.
The spelling of 2742520120751 in words is "two trillion, seven hundred forty-two billion, five hundred twenty million, one hundred twenty thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •