Base | Representation |
---|---|
bin | 100010000010111… |
… | …1101001101111101 |
3 | 2221121122112212101 |
4 | 1010011331031331 |
5 | 4314424142112 |
6 | 305205505101 |
7 | 40211225455 |
oct | 10405751575 |
9 | 2847575771 |
10 | 1142412157 |
11 | 536953187 |
12 | 27a712191 |
13 | 1528b0433 |
14 | aba1cd65 |
15 | 6a462757 |
hex | 4417d37d |
1142412157 has 2 divisors, whose sum is σ = 1142412158. Its totient is φ = 1142412156.
The previous prime is 1142412149. The next prime is 1142412181. The reversal of 1142412157 is 7512142411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1119170116 + 23242041 = 33454^2 + 4821^2 .
It is a cyclic number.
It is not a de Polignac number, because 1142412157 - 23 = 1142412149 is a prime.
It is a super-2 number, since 2×11424121572 = 2610211072922785298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1142412857) 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, 571206078 + 571206079.
It is an arithmetic number, because the mean of its divisors is an integer number (571206079).
Almost surely, 21142412157 is an apocalyptic number.
It is an amenable number.
1142412157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1142412157 is an equidigital number, since it uses as much as digits as its factorization.
1142412157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2240, while the sum is 28.
The square root of 1142412157 is about 33799.5881187922. The cubic root of 1142412157 is about 1045.3802045934.
Adding to 1142412157 its reverse (7512142411), we get a palindrome (8654554568).
The spelling of 1142412157 in words is "one billion, one hundred forty-two million, four hundred twelve thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •