Base | Representation |
---|---|
bin | 111110110001000… |
… | …100100100010101 |
3 | 2201101111112121201 |
4 | 332301010210111 |
5 | 4124040114112 |
6 | 252254312501 |
7 | 35044533664 |
oct | 7661044425 |
9 | 2641445551 |
10 | 1053051157 |
11 | 4a0468a14 |
12 | 2547b8731 |
13 | 13a2232c2 |
14 | 9dbdaddb |
15 | 626b0257 |
hex | 3ec44915 |
1053051157 has 2 divisors, whose sum is σ = 1053051158. Its totient is φ = 1053051156.
The previous prime is 1053051151. The next prime is 1053051169. The reversal of 1053051157 is 7511503501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1018311921 + 34739236 = 31911^2 + 5894^2 .
It is an emirp because it is prime and its reverse (7511503501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1053051157 - 27 = 1053051029 is a prime.
It is a super-2 number, since 2×10530511572 = 2217833478518077298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053051151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526525578 + 526525579.
It is an arithmetic number, because the mean of its divisors is an integer number (526525579).
Almost surely, 21053051157 is an apocalyptic number.
It is an amenable number.
1053051157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053051157 is an equidigital number, since it uses as much as digits as its factorization.
1053051157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2625, while the sum is 28.
The square root of 1053051157 is about 32450.7497139897. The cubic root of 1053051157 is about 1017.3799078705.
Adding to 1053051157 its reverse (7511503501), we get a palindrome (8564554658).
The spelling of 1053051157 in words is "one billion, fifty-three million, fifty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •