Base | Representation |
---|---|
bin | 100001101011101… |
… | …1101101000011101 |
3 | 2220202201100001222 |
4 | 1003113131220131 |
5 | 4303314133112 |
6 | 304052343125 |
7 | 40002514106 |
oct | 10327355035 |
9 | 2822640058 |
10 | 1130224157 |
11 | 52aa89157 |
12 | 276614aa5 |
13 | 1502039ba |
14 | aa1693ad |
15 | 69356372 |
hex | 435dda1d |
1130224157 has 2 divisors, whose sum is σ = 1130224158. Its totient is φ = 1130224156.
The previous prime is 1130224127. The next prime is 1130224159. The reversal of 1130224157 is 7514220311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 769452121 + 360772036 = 27739^2 + 18994^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130224157 - 26 = 1130224093 is a prime.
Together with 1130224159, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130224159) 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, 565112078 + 565112079.
It is an arithmetic number, because the mean of its divisors is an integer number (565112079).
Almost surely, 21130224157 is an apocalyptic number.
It is an amenable number.
1130224157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130224157 is an equidigital number, since it uses as much as digits as its factorization.
1130224157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 1130224157 is about 33618.8065969035. The cubic root of 1130224157 is about 1041.6493051855.
Adding to 1130224157 its reverse (7514220311), we get a palindrome (8644444468).
The spelling of 1130224157 in words is "one billion, one hundred thirty million, two hundred twenty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •