Base | Representation |
---|---|
bin | 10010110101001100… |
… | …10110110101101101 |
3 | 222002120122010011011 |
4 | 21122212112311231 |
5 | 131201121022203 |
6 | 4351111025221 |
7 | 505351030654 |
oct | 113246266555 |
9 | 28076563134 |
10 | 10109939053 |
11 | 4318884935 |
12 | 1b6196b211 |
13 | c51700b76 |
14 | 6bc9c019b |
15 | 3e287776d |
hex | 25a996d6d |
10109939053 has 2 divisors, whose sum is σ = 10109939054. Its totient is φ = 10109939052.
The previous prime is 10109939011. The next prime is 10109939113. The reversal of 10109939053 is 35093990101.
10109939053 is digitally balanced in base 3, 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., 6123532009 + 3986407044 = 78253^2 + 63138^2 .
It is a cyclic number.
It is not a de Polignac number, because 10109939053 - 213 = 10109930861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10109938997 and 10109939015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10109939953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5054969526 + 5054969527.
It is an arithmetic number, because the mean of its divisors is an integer number (5054969527).
Almost surely, 210109939053 is an apocalyptic number.
It is an amenable number.
10109939053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10109939053 is an equidigital number, since it uses as much as digits as its factorization.
10109939053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32805, while the sum is 40.
The spelling of 10109939053 in words is "ten billion, one hundred nine million, nine hundred thirty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •