Base | Representation |
---|---|
bin | 10011000100011000… |
… | …01101110101000011 |
3 | 222102110021221012021 |
4 | 21202030031311003 |
5 | 131431222213011 |
6 | 4411500542311 |
7 | 511455435505 |
oct | 114214156503 |
9 | 28373257167 |
10 | 10237304131 |
11 | 438376712a |
12 | 1b98551997 |
13 | c71c06212 |
14 | 6d1895d75 |
15 | 3edb35471 |
hex | 26230dd43 |
10237304131 has 2 divisors, whose sum is σ = 10237304132. Its totient is φ = 10237304130.
The previous prime is 10237304113. The next prime is 10237304149. The reversal of 10237304131 is 13140373201.
Together with previous prime (10237304113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (10237304113) and next prime (10237304149).
It is a cyclic number.
It is not a de Polignac number, because 10237304131 - 221 = 10235206979 is a prime.
It is a super-2 number, since 2×102373041312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10237304096 and 10237304105.
It is not a weakly prime, because it can be changed into another prime (10237305131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5118652065 + 5118652066.
It is an arithmetic number, because the mean of its divisors is an integer number (5118652066).
Almost surely, 210237304131 is an apocalyptic number.
10237304131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10237304131 is an equidigital number, since it uses as much as digits as its factorization.
10237304131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 25.
Adding to 10237304131 its reverse (13140373201), we get a palindrome (23377677332).
The spelling of 10237304131 in words is "ten billion, two hundred thirty-seven million, three hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •