Base | Representation |
---|---|
bin | 1101000100000110… |
… | …10111110010011101 |
3 | 200002210121221011201 |
4 | 12202003113302131 |
5 | 103331010311112 |
6 | 3115545115501 |
7 | 335543656225 |
oct | 64203276235 |
9 | 20083557151 |
10 | 7013760157 |
11 | 2a7a0a28a8 |
12 | 1438a88b91 |
13 | 87a113151 |
14 | 4a76dd085 |
15 | 2b0b36257 |
hex | 1a20d7c9d |
7013760157 has 2 divisors, whose sum is σ = 7013760158. Its totient is φ = 7013760156.
The previous prime is 7013760041. The next prime is 7013760163. The reversal of 7013760157 is 7510673107.
It is a happy number.
7013760157 is digitally balanced in base 3, 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., 6328838916 + 684921241 = 79554^2 + 26171^2 .
It is a cyclic number.
It is not a de Polignac number, because 7013760157 - 215 = 7013727389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7013760167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3506880078 + 3506880079.
It is an arithmetic number, because the mean of its divisors is an integer number (3506880079).
Almost surely, 27013760157 is an apocalyptic number.
It is an amenable number.
7013760157 is a deficient number, since it is larger than the sum of its proper divisors (1).
7013760157 is an equidigital number, since it uses as much as digits as its factorization.
7013760157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30870, while the sum is 37.
The square root of 7013760157 is about 83748.1949477122. The cubic root of 7013760157 is about 1914.1838020433.
The spelling of 7013760157 in words is "seven billion, thirteen million, seven hundred sixty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •