Base | Representation |
---|---|
bin | 10011110101100101… |
… | …11101000000011111 |
3 | 1000111020001202011202 |
4 | 21322302331000133 |
5 | 133302412041111 |
6 | 4520444510115 |
7 | 524630313206 |
oct | 117262750037 |
9 | 30436052152 |
10 | 10650112031 |
11 | 457578a889 |
12 | 209284b33b |
13 | 10095b0450 |
14 | 73063223d |
15 | 424ec8b3b |
hex | 27acbd01f |
10650112031 has 8 divisors (see below), whose sum is σ = 11839330944. Its totient is φ = 9513747360.
The previous prime is 10650111947. The next prime is 10650112091. The reversal of 10650112031 is 13021105601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10650112031 - 210 = 10650111007 is a prime.
It is a super-2 number, since 2×106501120312 (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 = 10650111994 and 10650112012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10650112091) 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 7 ways as a sum of consecutive naturals, for example, 13213136 + ... + 13213941.
It is an arithmetic number, because the mean of its divisors is an integer number (1479916368).
Almost surely, 210650112031 is an apocalyptic number.
10650112031 is a deficient number, since it is larger than the sum of its proper divisors (1189218913).
10650112031 is a wasteful number, since it uses less digits than its factorization.
10650112031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26427121.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 10650112031 its reverse (13021105601), we get a palindrome (23671217632).
The spelling of 10650112031 in words is "ten billion, six hundred fifty million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •