Base | Representation |
---|---|
bin | 10010101001100010… |
… | …01010110011001111 |
3 | 221211202112212222001 |
4 | 21110301022303033 |
5 | 131001100010111 |
6 | 4333254133131 |
7 | 503052350110 |
oct | 112461126317 |
9 | 27752485861 |
10 | 10012110031 |
11 | 4278636500 |
12 | 1b350511a7 |
13 | c3736a581 |
14 | 6ad9d6207 |
15 | 3d8ea11c1 |
hex | 254c4accf |
10012110031 has 12 divisors (see below), whose sum is σ = 12577197136. Its totient is φ = 7801643520.
The previous prime is 10012109993. The next prime is 10012110037. The reversal of 10012110031 is 13001121001.
10012110031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10012110031 - 27 = 10012109903 is a prime.
It is a super-2 number, since 2×100121100312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012110037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5909490 + ... + 5911183.
Almost surely, 210012110031 is an apocalyptic number.
10012110031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10012110031 is a deficient number, since it is larger than the sum of its proper divisors (2565087105).
10012110031 is a wasteful number, since it uses less digits than its factorization.
10012110031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11820702 (or 11820691 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 10012110031 its reverse (13001121001), we get a palindrome (23013231032).
The spelling of 10012110031 in words is "ten billion, twelve million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •