Base | Representation |
---|---|
bin | 100111111010000011111… |
… | …111101000100001101101 |
3 | 100201011121211020220100202 |
4 | 213322003333220201231 |
5 | 324412420312144323 |
6 | 5455502015203245 |
7 | 402063214151411 |
oct | 47720377504155 |
9 | 10634554226322 |
10 | 2742403631213 |
11 | 9680573a01a4 |
12 | 3835b5516525 |
13 | 16b7b8a4124c |
14 | 96a39688d41 |
15 | 4b509aadd28 |
hex | 27e83fe886d |
2742403631213 has 4 divisors (see below), whose sum is σ = 2754701405568. Its totient is φ = 2730105856860.
The previous prime is 2742403631207. The next prime is 2742403631239. The reversal of 2742403631213 is 3121363042472.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2742403631213 - 226 = 2742336522349 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2742403631113) 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, 6148886843 + ... + 6148887288.
It is an arithmetic number, because the mean of its divisors is an integer number (688675351392).
Almost surely, 22742403631213 is an apocalyptic number.
It is an amenable number.
2742403631213 is a deficient number, since it is larger than the sum of its proper divisors (12297774355).
2742403631213 is a wasteful number, since it uses less digits than its factorization.
2742403631213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12297774354.
The product of its (nonzero) digits is 145152, while the sum is 38.
Adding to 2742403631213 its reverse (3121363042472), we get a palindrome (5863766673685).
The spelling of 2742403631213 in words is "two trillion, seven hundred forty-two billion, four hundred three million, six hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •