Base | Representation |
---|---|
bin | 1000111111100010… |
… | …1111011010000011 |
3 | 20020020101201120212 |
4 | 2033320233122003 |
5 | 14420442004011 |
6 | 1035312424335 |
7 | 113551540622 |
oct | 21770573203 |
9 | 6206351525 |
10 | 2414016131 |
11 | 102971605a |
12 | 5745480ab |
13 | 2c6185517 |
14 | 18c86b6b9 |
15 | e1de408b |
hex | 8fe2f683 |
2414016131 has 2 divisors, whose sum is σ = 2414016132. Its totient is φ = 2414016130.
The previous prime is 2414016113. The next prime is 2414016149. The reversal of 2414016131 is 1316104142.
Together with previous prime (2414016113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (2414016113) and next prime (2414016149).
It is a cyclic number.
It is not a de Polignac number, because 2414016131 - 26 = 2414016067 is a prime.
It is a super-2 number, since 2×24140161312 = 11654947761456418322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 2414016097 and 2414016106.
It is not a weakly prime, because it can be changed into another prime (2414016151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1207008065 + 1207008066.
It is an arithmetic number, because the mean of its divisors is an integer number (1207008066).
Almost surely, 22414016131 is an apocalyptic number.
2414016131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2414016131 is an equidigital number, since it uses as much as digits as its factorization.
2414016131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
The square root of 2414016131 is about 49132.6381441095. The cubic root of 2414016131 is about 1341.4671927990.
The spelling of 2414016131 in words is "two billion, four hundred fourteen million, sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •