Base | Representation |
---|---|
bin | 10011000000010011… |
… | …01111001101101011 |
3 | 222100001221011222000 |
4 | 21200021233031223 |
5 | 131343443200021 |
6 | 4404235502043 |
7 | 510561630156 |
oct | 114011571553 |
9 | 28301834860 |
10 | 10203100011 |
11 | 4366425065 |
12 | 1b88bb7923 |
13 | c67abb7b0 |
14 | 6cb110c9d |
15 | 3eab2ab26 |
hex | 26026f36b |
10203100011 has 32 divisors (see below), whose sum is σ = 16286430720. Its totient is φ = 6275752992.
The previous prime is 10203100009. The next prime is 10203100021. The reversal of 10203100011 is 11000130201.
10203100011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10203100011 - 21 = 10203100009 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 = 10203099966 and 10203100002.
It is not an unprimeable number, because it can be changed into a prime (10203100021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 860026 + ... + 871808.
It is an arithmetic number, because the mean of its divisors is an integer number (508950960).
Almost surely, 210203100011 is an apocalyptic number.
10203100011 is a deficient number, since it is larger than the sum of its proper divisors (6083330709).
10203100011 is a wasteful number, since it uses less digits than its factorization.
10203100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14272 (or 14266 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10203100011 its reverse (11000130201), we get a palindrome (21203230212).
The spelling of 10203100011 in words is "ten billion, two hundred three million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •