Base | Representation |
---|---|
bin | 10010111001000010… |
… | …11111111011111111 |
3 | 222011211101011022221 |
4 | 21130201133323333 |
5 | 131232402020111 |
6 | 4354222550211 |
7 | 506222306416 |
oct | 113441377377 |
9 | 28154334287 |
10 | 10142220031 |
11 | 4335023029 |
12 | 1b70738367 |
13 | c582c4138 |
14 | 6c2dc447d |
15 | 3e5602371 |
hex | 25c85feff |
10142220031 has 2 divisors, whose sum is σ = 10142220032. Its totient is φ = 10142220030.
The previous prime is 10142220019. The next prime is 10142220041. The reversal of 10142220031 is 13002224101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10142220031 - 29 = 10142219519 is a prime.
It is a super-2 number, since 2×101422200312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10142219987 and 10142220014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10142220041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071110015 + 5071110016.
It is an arithmetic number, because the mean of its divisors is an integer number (5071110016).
Almost surely, 210142220031 is an apocalyptic number.
10142220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142220031 is an equidigital number, since it uses as much as digits as its factorization.
10142220031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 10142220031 its reverse (13002224101), we get a palindrome (23144444132).
The spelling of 10142220031 in words is "ten billion, one hundred forty-two million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •