Base | Representation |
---|---|
bin | 110000001110011110100000… |
… | …0000101001101100010011111 |
3 | 2001121222022210102002202000121 |
4 | 1200130331000011031202133 |
5 | 421100111410132011111 |
6 | 4102111431542335411 |
7 | 155231406510623302 |
oct | 14034750005154237 |
9 | 2047868712082017 |
10 | 424202110032031 |
11 | 113189117206821 |
12 | 3b6b126442a567 |
13 | 15291119b3a536 |
14 | 76a76c5224b39 |
15 | 340970c78d871 |
hex | 181cf4014d89f |
424202110032031 has 2 divisors, whose sum is σ = 424202110032032. Its totient is φ = 424202110032030.
The previous prime is 424202110032023. The next prime is 424202110032037. The reversal of 424202110032031 is 130230011202424.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 424202110032031 - 23 = 424202110032023 is a prime.
It is a super-2 number, since 2×4242021100320312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 424202110031987 and 424202110032005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (424202110032037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212101055016015 + 212101055016016.
It is an arithmetic number, because the mean of its divisors is an integer number (212101055016016).
Almost surely, 2424202110032031 is an apocalyptic number.
424202110032031 is a deficient number, since it is larger than the sum of its proper divisors (1).
424202110032031 is an equidigital number, since it uses as much as digits as its factorization.
424202110032031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 424202110032031 its reverse (130230011202424), we get a palindrome (554432121234455).
The spelling of 424202110032031 in words is "four hundred twenty-four trillion, two hundred two billion, one hundred ten million, thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •