Base | Representation |
---|---|
bin | 10010110101101000… |
… | …11110001011010001 |
3 | 222002211121002200201 |
4 | 21122310132023101 |
5 | 131203042422441 |
6 | 4351322215201 |
7 | 505424341225 |
oct | 113264361321 |
9 | 28084532621 |
10 | 10113639121 |
11 | 431a981843 |
12 | 1b63054501 |
13 | c523c8061 |
14 | 6bd2a4785 |
15 | 3e2d58c31 |
hex | 25ad1e2d1 |
10113639121 has 2 divisors, whose sum is σ = 10113639122. Its totient is φ = 10113639120.
The previous prime is 10113639047. The next prime is 10113639139. The reversal of 10113639121 is 12193631101.
10113639121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8111524096 + 2002115025 = 90064^2 + 44745^2 .
It is a cyclic number.
It is not a de Polignac number, because 10113639121 - 217 = 10113508049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10113639121.
It is not a weakly prime, because it can be changed into another prime (10113639421) 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 as a sum of consecutive naturals, namely, 5056819560 + 5056819561.
It is an arithmetic number, because the mean of its divisors is an integer number (5056819561).
Almost surely, 210113639121 is an apocalyptic number.
It is an amenable number.
10113639121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10113639121 is an equidigital number, since it uses as much as digits as its factorization.
10113639121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 28.
The spelling of 10113639121 in words is "ten billion, one hundred thirteen million, six hundred thirty-nine thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •