Base | Representation |
---|---|
bin | 1010100010111010001010110… |
… | …0000111001101101000110001 |
3 | 10121022110012210010221210200012 |
4 | 2220232202230013031220301 |
5 | 1234231034140204340323 |
6 | 11150130153550504305 |
7 | 312206541160530152 |
oct | 25056425407155061 |
9 | 3538405703853605 |
10 | 742070157105713 |
11 | 1a54a0205a58977 |
12 | 6b28a202205095 |
13 | 25b0abb9615297 |
14 | d13655c839929 |
15 | 5abce3397c678 |
hex | 2a2e8ac1cda31 |
742070157105713 has 2 divisors, whose sum is σ = 742070157105714. Its totient is φ = 742070157105712.
The previous prime is 742070157105707. The next prime is 742070157105791. The reversal of 742070157105713 is 317501751070247.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 733571602813729 + 8498554291984 = 27084527^2 + 2915228^2 .
It is a cyclic number.
It is not a de Polignac number, because 742070157105713 - 212 = 742070157101617 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (742070157104713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 371035078552856 + 371035078552857.
It is an arithmetic number, because the mean of its divisors is an integer number (371035078552857).
Almost surely, 2742070157105713 is an apocalyptic number.
It is an amenable number.
742070157105713 is a deficient number, since it is larger than the sum of its proper divisors (1).
742070157105713 is an equidigital number, since it uses as much as digits as its factorization.
742070157105713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440600, while the sum is 50.
The spelling of 742070157105713 in words is "seven hundred forty-two trillion, seventy billion, one hundred fifty-seven million, one hundred five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •