Base | Representation |
---|---|
bin | 10010110101001111… |
… | …10010010000011101 |
3 | 222002121100010210121 |
4 | 21122213302100131 |
5 | 131201220013001 |
6 | 4351123034541 |
7 | 505354150441 |
oct | 113247622035 |
9 | 28077303717 |
10 | 10110313501 |
11 | 43190101a2 |
12 | 1b61b0ba51 |
13 | c51802432 |
14 | 6bca7a821 |
15 | 3e28ed6a1 |
hex | 25a9f241d |
10110313501 has 2 divisors, whose sum is σ = 10110313502. Its totient is φ = 10110313500.
The previous prime is 10110313487. The next prime is 10110313511. The reversal of 10110313501 is 10531301101.
10110313501 is digitally balanced in base 2 and base 3, because in such bases 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., 7738720900 + 2371592601 = 87970^2 + 48699^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110313501 - 217 = 10110182429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110313511) 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, 5055156750 + 5055156751.
It is an arithmetic number, because the mean of its divisors is an integer number (5055156751).
Almost surely, 210110313501 is an apocalyptic number.
It is an amenable number.
10110313501 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110313501 is an equidigital number, since it uses as much as digits as its factorization.
10110313501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45, while the sum is 16.
Adding to 10110313501 its reverse (10531301101), we get a palindrome (20641614602).
The spelling of 10110313501 in words is "ten billion, one hundred ten million, three hundred thirteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •