Base | Representation |
---|---|
bin | 10011010100011111… |
… | …10010110111111111 |
3 | 222202212121120020100 |
4 | 21222033302313333 |
5 | 132220322210111 |
6 | 4433125452143 |
7 | 515016312153 |
oct | 115217626777 |
9 | 28685546210 |
10 | 10372460031 |
11 | 4442a8a81a |
12 | 2015871053 |
13 | c93c0871b |
14 | 7057d9063 |
15 | 40a931756 |
hex | 26a3f2dff |
10372460031 has 12 divisors (see below), whose sum is σ = 15770992120. Its totient is φ = 6551027280.
The previous prime is 10372460027. The next prime is 10372460041. The reversal of 10372460031 is 13006427301.
10372460031 is a `hidden beast` number, since 1 + 0 + 3 + 7 + 24 + 600 + 31 = 666.
It is not a de Polignac number, because 10372460031 - 22 = 10372460027 is a prime.
It is a super-2 number, since 2×103724600312 (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 = 10372459977 and 10372460004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10372460011) 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 in 11 ways as a sum of consecutive naturals, for example, 30328660 + ... + 30329001.
Almost surely, 210372460031 is an apocalyptic number.
10372460031 is a deficient number, since it is larger than the sum of its proper divisors (5398532089).
10372460031 is a wasteful number, since it uses less digits than its factorization.
10372460031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60657686 (or 60657683 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
Adding to 10372460031 its reverse (13006427301), we get a palindrome (23378887332).
The spelling of 10372460031 in words is "ten billion, three hundred seventy-two million, four hundred sixty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •