Base | Representation |
---|---|
bin | 10011001011110111… |
… | …10011100010100011 |
3 | 222120211110212001000 |
4 | 21211323303202203 |
5 | 132043312023021 |
6 | 4422023043043 |
7 | 513150333111 |
oct | 114573634243 |
9 | 28524425030 |
10 | 10300111011 |
11 | 4406164943 |
12 | 1bb55a0483 |
13 | c81c26958 |
14 | 6d9d64ab1 |
15 | 4043deb26 |
hex | 265ef38a3 |
10300111011 has 32 divisors (see below), whose sum is σ = 16164126720. Its totient is φ = 6459979392.
The previous prime is 10300111007. The next prime is 10300111013. The reversal of 10300111011 is 11011100301.
10300111011 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10300111011 - 22 = 10300111007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10300110984 and 10300111002.
It is not an unprimeable number, because it can be changed into a prime (10300111013) 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 31 ways as a sum of consecutive naturals, for example, 1641466 + ... + 1647728.
It is an arithmetic number, because the mean of its divisors is an integer number (505128960).
Almost surely, 210300111011 is an apocalyptic number.
10300111011 is a deficient number, since it is larger than the sum of its proper divisors (5864015709).
10300111011 is a wasteful number, since it uses less digits than its factorization.
10300111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9872 (or 9866 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 10300111011 its reverse (11011100301), we get a palindrome (21311211312).
The spelling of 10300111011 in words is "ten billion, three hundred million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •