Base | Representation |
---|---|
bin | 100001101011101… |
… | …1010111100010101 |
3 | 2220202200202221222 |
4 | 1003113122330111 |
5 | 4303313310031 |
6 | 304052220125 |
7 | 40002440021 |
oct | 10327327425 |
9 | 2822622858 |
10 | 1130213141 |
11 | 52aa80952 |
12 | 27660a645 |
13 | 1501cb995 |
14 | aa165381 |
15 | 69352e7b |
hex | 435daf15 |
1130213141 has 2 divisors, whose sum is σ = 1130213142. Its totient is φ = 1130213140.
The previous prime is 1130213107. The next prime is 1130213153. The reversal of 1130213141 is 1413120311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 989102500 + 141110641 = 31450^2 + 11879^2 .
It is an emirp because it is prime and its reverse (1413120311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1130213141 - 210 = 1130212117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130213101) 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, 565106570 + 565106571.
It is an arithmetic number, because the mean of its divisors is an integer number (565106571).
Almost surely, 21130213141 is an apocalyptic number.
It is an amenable number.
1130213141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130213141 is an equidigital number, since it uses as much as digits as its factorization.
1130213141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 1130213141 is about 33618.6427596356. The cubic root of 1130213141 is about 1041.6459209465.
Adding to 1130213141 its reverse (1413120311), we get a palindrome (2543333452).
The spelling of 1130213141 in words is "one billion, one hundred thirty million, two hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •