Base | Representation |
---|---|
bin | 100111111010010000011… |
… | …011110100011000001101 |
3 | 100201012011100222201202011 |
4 | 213322100123310120031 |
5 | 324413332230041011 |
6 | 5455534432501221 |
7 | 402101330204425 |
oct | 47722033643015 |
9 | 10635140881664 |
10 | 2742612346381 |
11 | 968154195a76 |
12 | 3836533aa811 |
13 | 16b82005a34b |
14 | 96a59299485 |
15 | 4b51d08a621 |
hex | 27e906f460d |
2742612346381 has 2 divisors, whose sum is σ = 2742612346382. Its totient is φ = 2742612346380.
The previous prime is 2742612346189. The next prime is 2742612346417. The reversal of 2742612346381 is 1836432162472.
2742612346381 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1563835285156 + 1178777061225 = 1250534^2 + 1085715^2 .
It is a cyclic number.
It is not a de Polignac number, because 2742612346381 - 213 = 2742612338189 is a prime.
It is a super-2 number, since 2×27426123463812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2742612346181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1371306173190 + 1371306173191.
It is an arithmetic number, because the mean of its divisors is an integer number (1371306173191).
Almost surely, 22742612346381 is an apocalyptic number.
It is an amenable number.
2742612346381 is a deficient number, since it is larger than the sum of its proper divisors (1).
2742612346381 is an equidigital number, since it uses as much as digits as its factorization.
2742612346381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2322432, while the sum is 49.
The spelling of 2742612346381 in words is "two trillion, seven hundred forty-two billion, six hundred twelve million, three hundred forty-six thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •