Base | Representation |
---|---|
bin | 111101011101011… |
… | …000110111100101 |
3 | 2122212020000210022 |
4 | 331131120313211 |
5 | 4102431123323 |
6 | 250152204525 |
7 | 34360216613 |
oct | 7535306745 |
9 | 2585200708 |
10 | 1031114213 |
11 | 48a045408 |
12 | 249399745 |
13 | 13581236c |
14 | 9ad2a6b3 |
15 | 607ca4c8 |
hex | 3d758de5 |
1031114213 has 2 divisors, whose sum is σ = 1031114214. Its totient is φ = 1031114212.
The previous prime is 1031114191. The next prime is 1031114233. The reversal of 1031114213 is 3124111301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1019971969 + 11142244 = 31937^2 + 3338^2 .
It is a cyclic number.
It is not a de Polignac number, because 1031114213 - 214 = 1031097829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1031114191 and 1031114200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1031114233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515557106 + 515557107.
It is an arithmetic number, because the mean of its divisors is an integer number (515557107).
Almost surely, 21031114213 is an apocalyptic number.
It is an amenable number.
1031114213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031114213 is an equidigital number, since it uses as much as digits as its factorization.
1031114213 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 1031114213 is about 32110.9671763402. The cubic root of 1031114213 is about 1010.2656599478.
Adding to 1031114213 its reverse (3124111301), we get a palindrome (4155225514).
The spelling of 1031114213 in words is "one billion, thirty-one million, one hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •