Base | Representation |
---|---|
bin | 10011000000010011… |
… | …10001111011001001 |
3 | 222100001221202012012 |
4 | 21200021301323021 |
5 | 131343444023423 |
6 | 4404240025305 |
7 | 510562004426 |
oct | 114011617311 |
9 | 28301852165 |
10 | 10203111113 |
11 | 4366432438 |
12 | 1b89002235 |
13 | c67ac3870 |
14 | 6cb114d4d |
15 | 3eab2e078 |
hex | 260271ec9 |
10203111113 has 8 divisors (see below), whose sum is σ = 10997131656. Its totient is φ = 9410400000.
The previous prime is 10203111109. The next prime is 10203111179. The reversal of 10203111113 is 31111130201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 161467849 + 10041643264 = 12707^2 + 100208^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10203111113 - 22 = 10203111109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10203113113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 311138 + ... + 342363.
It is an arithmetic number, because the mean of its divisors is an integer number (1374641457).
Almost surely, 210203111113 is an apocalyptic number.
10203111113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10203111113 is a deficient number, since it is larger than the sum of its proper divisors (794020543).
10203111113 is a wasteful number, since it uses less digits than its factorization.
10203111113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654715.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10203111113 its reverse (31111130201), we get a palindrome (41314241314).
The spelling of 10203111113 in words is "ten billion, two hundred three million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •