Base | Representation |
---|---|
bin | 100111111010001011110… |
… | …001000000100001111101 |
3 | 100201011221220121002102122 |
4 | 213322023301000201331 |
5 | 324413202201440401 |
6 | 5455522553532325 |
7 | 402066356331356 |
oct | 47721361004175 |
9 | 10634856532378 |
10 | 2742534015101 |
11 | 968113a54581 |
12 | 3836311140a5 |
13 | 16b809a6268a |
14 | 96a4cb08d2d |
15 | 4b51626621b |
hex | 27e8bc4087d |
2742534015101 has 2 divisors, whose sum is σ = 2742534015102. Its totient is φ = 2742534015100.
The previous prime is 2742534015097. The next prime is 2742534015121. The reversal of 2742534015101 is 1015104352472.
2742534015101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1511488289476 + 1231045725625 = 1229426^2 + 1109525^2 .
It is a cyclic number.
It is not a de Polignac number, because 2742534015101 - 22 = 2742534015097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2742534015121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1371267007550 + 1371267007551.
It is an arithmetic number, because the mean of its divisors is an integer number (1371267007551).
Almost surely, 22742534015101 is an apocalyptic number.
It is an amenable number.
2742534015101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2742534015101 is an equidigital number, since it uses as much as digits as its factorization.
2742534015101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33600, while the sum is 35.
Adding to 2742534015101 its reverse (1015104352472), we get a palindrome (3757638367573).
The spelling of 2742534015101 in words is "two trillion, seven hundred forty-two billion, five hundred thirty-four million, fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •