Base | Representation |
---|---|
bin | 111110100101100… |
… | …000110100100101 |
3 | 2201011210121020111 |
4 | 332211200310211 |
5 | 4122301134112 |
6 | 252105333021 |
7 | 35010014113 |
oct | 7645406445 |
9 | 2634717214 |
10 | 1050021157 |
11 | 499789489 |
12 | 253797171 |
13 | 1397020c3 |
14 | 9d64cab3 |
15 | 622b25a7 |
hex | 3e960d25 |
1050021157 has 2 divisors, whose sum is σ = 1050021158. Its totient is φ = 1050021156.
The previous prime is 1050021143. The next prime is 1050021191. The reversal of 1050021157 is 7511200501.
1050021157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 963419521 + 86601636 = 31039^2 + 9306^2 .
It is a cyclic number.
It is not a de Polignac number, because 1050021157 - 223 = 1041632549 is a prime.
It is a super-2 number, since 2×10500211572 = 2205088860295237298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1050021857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525010578 + 525010579.
It is an arithmetic number, because the mean of its divisors is an integer number (525010579).
Almost surely, 21050021157 is an apocalyptic number.
It is an amenable number.
1050021157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050021157 is an equidigital number, since it uses as much as digits as its factorization.
1050021157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 350, while the sum is 22.
The square root of 1050021157 is about 32404.0299499923. The cubic root of 1050021157 is about 1016.4031834032.
Adding to 1050021157 its reverse (7511200501), we get a palindrome (8561221658).
The spelling of 1050021157 in words is "one billion, fifty million, twenty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •