Base | Representation |
---|---|
bin | 10010101001100010… |
… | …01101001111011111 |
3 | 221211202120101200102 |
4 | 21110301031033133 |
5 | 131001100320111 |
6 | 4333254251315 |
7 | 503052421214 |
oct | 112461151737 |
9 | 27752511612 |
10 | 10012120031 |
11 | 4278642a71 |
12 | 1b35056b3b |
13 | c37371ca4 |
14 | 6ad9d9b0b |
15 | 3d8ea413b |
hex | 254c4d3df |
10012120031 has 4 divisors (see below), whose sum is σ = 10013837064. Its totient is φ = 10010403000.
The previous prime is 10012120021. The next prime is 10012120037. The reversal of 10012120031 is 13002121001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10012120031 - 26 = 10012119967 is a prime.
It is a super-2 number, since 2×100121200312 (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 = 10012119994 and 10012120021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012120037) 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, 849740 + ... + 861441.
It is an arithmetic number, because the mean of its divisors is an integer number (2503459266).
Almost surely, 210012120031 is an apocalyptic number.
10012120031 is a deficient number, since it is larger than the sum of its proper divisors (1717033).
10012120031 is an equidigital number, since it uses as much as digits as its factorization.
10012120031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1717032.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10012120031 its reverse (13002121001), we get a palindrome (23014241032).
The spelling of 10012120031 in words is "ten billion, twelve million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •