Base | Representation |
---|---|
bin | 10010101011000000… |
… | …01011100111010011 |
3 | 221212121202000110012 |
4 | 21111200023213103 |
5 | 131012223343011 |
6 | 4334414225135 |
7 | 503262166325 |
oct | 112540134723 |
9 | 27777660405 |
10 | 10024434131 |
11 | 4284593808 |
12 | 1b391b51ab |
13 | c39a93c3a |
14 | 6b14c3615 |
15 | 3da0d7a8b |
hex | 25580b9d3 |
10024434131 has 4 divisors (see below), whose sum is σ = 10090821264. Its totient is φ = 9958047000.
The previous prime is 10024434127. The next prime is 10024434157. The reversal of 10024434131 is 13143442001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13143442001 = 2207 ⋅5955343.
It is a cyclic number.
It is not a de Polignac number, because 10024434131 - 22 = 10024434127 is a prime.
It is a super-2 number, since 2×100244341312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10024434097 and 10024434106.
It is not an unprimeable number, because it can be changed into a prime (10024434731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33193340 + ... + 33193641.
It is an arithmetic number, because the mean of its divisors is an integer number (2522705316).
Almost surely, 210024434131 is an apocalyptic number.
10024434131 is a deficient number, since it is larger than the sum of its proper divisors (66387133).
10024434131 is an equidigital number, since it uses as much as digits as its factorization.
10024434131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66387132.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 10024434131 its reverse (13143442001), we get a palindrome (23167876132).
The spelling of 10024434131 in words is "ten billion, twenty-four million, four hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •