Base | Representation |
---|---|
bin | 100111111001101011111… |
… | …101010001000000100101 |
3 | 100201010120201102110201002 |
4 | 213321223331101000211 |
5 | 324411104042414123 |
6 | 5455354011443045 |
7 | 402050216323142 |
oct | 47715375210045 |
9 | 10633521373632 |
10 | 2742000357413 |
11 | 96796a799669 |
12 | 383502456485 |
13 | 16b7533247b5 |
14 | 969dbcb13c9 |
15 | 4b4d44a0528 |
hex | 27e6bf51025 |
2742000357413 has 4 divisors (see below), whose sum is σ = 2762014958700. Its totient is φ = 2721985756128.
The previous prime is 2742000357319. The next prime is 2742000357469. The reversal of 2742000357413 is 3147530002472.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2295003815329 + 446996542084 = 1514927^2 + 668578^2 .
It is a cyclic number.
It is not a de Polignac number, because 2742000357413 - 218 = 2742000095269 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 (2742000350413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10007300438 + ... + 10007300711.
It is an arithmetic number, because the mean of its divisors is an integer number (690503739675).
Almost surely, 22742000357413 is an apocalyptic number.
It is an amenable number.
2742000357413 is a deficient number, since it is larger than the sum of its proper divisors (20014601287).
2742000357413 is a wasteful number, since it uses less digits than its factorization.
2742000357413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20014601286.
The product of its (nonzero) digits is 141120, while the sum is 38.
Adding to 2742000357413 its reverse (3147530002472), we get a palindrome (5889530359885).
The spelling of 2742000357413 in words is "two trillion, seven hundred forty-two billion, three hundred fifty-seven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •