Base | Representation |
---|---|
bin | 10011001101011010… |
… | …11001010111100011 |
3 | 222121201221022200111 |
4 | 21212231121113203 |
5 | 132110124023021 |
6 | 4423205432151 |
7 | 513365666020 |
oct | 114655312743 |
9 | 28551838614 |
10 | 10313111011 |
11 | 4412533a45 |
12 | 1bb9a0b657 |
13 | c84828b68 |
14 | 6db98a547 |
15 | 40560b8e1 |
hex | 266b595e3 |
10313111011 has 8 divisors (see below), whose sum is σ = 11935608320. Its totient is φ = 8727912648.
The previous prime is 10313110991. The next prime is 10313111027. The reversal of 10313111011 is 11011131301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10313111011 - 29 = 10313110499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10313110982 and 10313111000.
It is not an unprimeable number, because it can be changed into a prime (10313111041) 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, 9324141 + ... + 9325246.
It is an arithmetic number, because the mean of its divisors is an integer number (1491951040).
Almost surely, 210313111011 is an apocalyptic number.
10313111011 is a deficient number, since it is larger than the sum of its proper divisors (1622497309).
10313111011 is an equidigital number, since it uses as much as digits as its factorization.
10313111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18649473.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 10313111011 its reverse (11011131301), we get a palindrome (21324242312).
The spelling of 10313111011 in words is "ten billion, three hundred thirteen million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •