Base | Representation |
---|---|
bin | 10011001100010000… |
… | …00001010001110011 |
3 | 222121001111112100121 |
4 | 21212020001101303 |
5 | 132100122004021 |
6 | 4422215431111 |
7 | 513216500305 |
oct | 114610012163 |
9 | 28531445317 |
10 | 10303313011 |
11 | 4407a51622 |
12 | 1bb6685497 |
13 | c827a8224 |
14 | 6da559975 |
15 | 404823741 |
hex | 266201473 |
10303313011 has 4 divisors (see below), whose sum is σ = 10371547024. Its totient is φ = 10235079000.
The previous prime is 10303312991. The next prime is 10303313021. The reversal of 10303313011 is 11031330301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11031330301 = 16189 ⋅681409.
It is a cyclic number.
It is not a de Polignac number, because 10303313011 - 27 = 10303312883 is a prime.
It is a super-2 number, since 2×103033130112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10303313021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34116780 + ... + 34117081.
It is an arithmetic number, because the mean of its divisors is an integer number (2592886756).
Almost surely, 210303313011 is an apocalyptic number.
10303313011 is a deficient number, since it is larger than the sum of its proper divisors (68234013).
10303313011 is an equidigital number, since it uses as much as digits as its factorization.
10303313011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68234012.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 10303313011 its reverse (11031330301), we get a palindrome (21334643312).
The spelling of 10303313011 in words is "ten billion, three hundred three million, three hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •