Base | Representation |
---|---|
bin | 10010111001000010… |
… | …11011100010101111 |
3 | 222011211100020122021 |
4 | 21130201123202233 |
5 | 131232400431111 |
6 | 4354222331011 |
7 | 506222203063 |
oct | 113441334257 |
9 | 28154306567 |
10 | 10142202031 |
11 | 4335010555 |
12 | 1b70729a67 |
13 | c582b8ba0 |
14 | 6c2dbbaa3 |
15 | 3e55ebd71 |
hex | 25c85b8af |
10142202031 has 8 divisors (see below), whose sum is σ = 10923179904. Its totient is φ = 9361339680.
The previous prime is 10142202029. The next prime is 10142202089. The reversal of 10142202031 is 13020224101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10142202031 - 21 = 10142202029 is a prime.
It is a super-2 number, since 2×101422020312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10142201996 and 10142202014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10142202131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 262146 + ... + 298336.
It is an arithmetic number, because the mean of its divisors is an integer number (1365397488).
Almost surely, 210142202031 is an apocalyptic number.
10142202031 is a deficient number, since it is larger than the sum of its proper divisors (780977873).
10142202031 is a wasteful number, since it uses less digits than its factorization.
10142202031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57761.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 10142202031 its reverse (13020224101), we get a palindrome (23162426132).
It can be divided in two parts, 10142 and 202031, that multiplied together give a palindrome (2048998402).
The spelling of 10142202031 in words is "ten billion, one hundred forty-two million, two hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •