Base | Representation |
---|---|
bin | 111110100110101… |
… | …010000100000101 |
3 | 2201012100211202121 |
4 | 332212222010011 |
5 | 4122340234112 |
6 | 252120005541 |
7 | 35012403544 |
oct | 7646520405 |
9 | 2635324677 |
10 | 1050321157 |
11 | 499973916 |
12 | 2539008b1 |
13 | 1397a8812 |
14 | 9d6ca15b |
15 | 62321407 |
hex | 3e9aa105 |
1050321157 has 2 divisors, whose sum is σ = 1050321158. Its totient is φ = 1050321156.
The previous prime is 1050321133. The next prime is 1050321163. The reversal of 1050321157 is 7511230501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 770562081 + 279759076 = 27759^2 + 16726^2 .
It is an emirp because it is prime and its reverse (7511230501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1050321157 - 27 = 1050321029 is a prime.
It is a super-2 number, since 2×10503211572 = 2206349065683637298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1050322157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525160578 + 525160579.
It is an arithmetic number, because the mean of its divisors is an integer number (525160579).
Almost surely, 21050321157 is an apocalyptic number.
It is an amenable number.
1050321157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050321157 is an equidigital number, since it uses as much as digits as its factorization.
1050321157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1050, while the sum is 25.
The square root of 1050321157 is about 32408.6586732620. The cubic root of 1050321157 is about 1016.4999725387.
Adding to 1050321157 its reverse (7511230501), we get a palindrome (8561551658).
The spelling of 1050321157 in words is "one billion, fifty million, three hundred twenty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •