Base | Representation |
---|---|
bin | 111100001111001… |
… | …000110011000101 |
3 | 2121102121212011111 |
4 | 330033020303011 |
5 | 4032203214112 |
6 | 244140405021 |
7 | 34020653026 |
oct | 7417106305 |
9 | 2542555144 |
10 | 1010601157 |
11 | 479504675 |
12 | 242546771 |
13 | 1314ac567 |
14 | 9830ac4d |
15 | 5dac75a7 |
hex | 3c3c8cc5 |
1010601157 has 2 divisors, whose sum is σ = 1010601158. Its totient is φ = 1010601156.
The previous prime is 1010601131. The next prime is 1010601161. The reversal of 1010601157 is 7511060101.
1010601157 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., 628555041 + 382046116 = 25071^2 + 19546^2 .
It is an emirp because it is prime and its reverse (7511060101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010601157 - 227 = 876383429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010601107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505300578 + 505300579.
It is an arithmetic number, because the mean of its divisors is an integer number (505300579).
Almost surely, 21010601157 is an apocalyptic number.
It is an amenable number.
1010601157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010601157 is an equidigital number, since it uses as much as digits as its factorization.
1010601157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 210, while the sum is 22.
The square root of 1010601157 is about 31789.9537118254. The cubic root of 1010601157 is about 1003.5213048579.
Adding to 1010601157 its reverse (7511060101), we get a palindrome (8521661258).
The spelling of 1010601157 in words is "one billion, ten million, six hundred one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •