Base | Representation |
---|---|
bin | 10010101101000111… |
… | …00111110001101011 |
3 | 221220212000012110222 |
4 | 21112203213301223 |
5 | 131031240110011 |
6 | 4340245200255 |
7 | 503565360521 |
oct | 112643476153 |
9 | 27825005428 |
10 | 10042113131 |
11 | 4293569256 |
12 | 1b4310008b |
13 | c40643a9b |
14 | 6b39a6311 |
15 | 3db92addb |
hex | 2568e7c6b |
10042113131 has 4 divisors (see below), whose sum is σ = 10313521632. Its totient is φ = 9770704632.
The previous prime is 10042113121. The next prime is 10042113167. The reversal of 10042113131 is 13131124001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13131124001 = 149 ⋅88128349.
It is a cyclic number.
It is not a de Polignac number, because 10042113131 - 210 = 10042112107 is a prime.
It is a super-2 number, since 2×100421131312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10042113101) 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 in 3 ways as a sum of consecutive naturals, for example, 135704195 + ... + 135704268.
It is an arithmetic number, because the mean of its divisors is an integer number (2578380408).
Almost surely, 210042113131 is an apocalyptic number.
10042113131 is a deficient number, since it is larger than the sum of its proper divisors (271408501).
10042113131 is an equidigital number, since it uses as much as digits as its factorization.
10042113131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271408500.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10042113131 its reverse (13131124001), we get a palindrome (23173237132).
The spelling of 10042113131 in words is "ten billion, forty-two million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •