Base | Representation |
---|---|
bin | 10010110100101010… |
… | …11011010111000001 |
3 | 222002021021122110022 |
4 | 21122111123113001 |
5 | 131144002013441 |
6 | 4350431543225 |
7 | 505265225252 |
oct | 113225332701 |
9 | 28067248408 |
10 | 10105501121 |
11 | 4316323621 |
12 | 1b6038ab15 |
13 | c50808b81 |
14 | 6bc186b29 |
15 | 3e229c84b |
hex | 25a55b5c1 |
10105501121 has 2 divisors, whose sum is σ = 10105501122. Its totient is φ = 10105501120.
The previous prime is 10105501111. The next prime is 10105501163. The reversal of 10105501121 is 12110550101.
10105501121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8942350096 + 1163151025 = 94564^2 + 34105^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10105501121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10105501121.
It is not a weakly prime, because it can be changed into another prime (10105501111) 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, 5052750560 + 5052750561.
It is an arithmetic number, because the mean of its divisors is an integer number (5052750561).
Almost surely, 210105501121 is an apocalyptic number.
It is an amenable number.
10105501121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10105501121 is an equidigital number, since it uses as much as digits as its factorization.
10105501121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50, while the sum is 17.
The spelling of 10105501121 in words is "ten billion, one hundred five million, five hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •