Base | Representation |
---|---|
bin | 10010101101100000… |
… | …110000100100011101 |
3 | 1220212011121020022201 |
4 | 102231200300210131 |
5 | 312121233240401 |
6 | 13121334011501 |
7 | 1310604650335 |
oct | 225540604435 |
9 | 56764536281 |
10 | 20090915101 |
11 | 857a885974 |
12 | 3a884a6b91 |
13 | 1b8248a25a |
14 | d883d00c5 |
15 | 7c8c28b01 |
hex | 4ad83091d |
20090915101 has 2 divisors, whose sum is σ = 20090915102. Its totient is φ = 20090915100.
The previous prime is 20090915087. The next prime is 20090915167. The reversal of 20090915101 is 10151909002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15438311001 + 4652604100 = 124251^2 + 68210^2 .
It is a cyclic number.
It is not a de Polignac number, because 20090915101 - 27 = 20090914973 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20090915101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20090945101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10045457550 + 10045457551.
It is an arithmetic number, because the mean of its divisors is an integer number (10045457551).
Almost surely, 220090915101 is an apocalyptic number.
It is an amenable number.
20090915101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20090915101 is an equidigital number, since it uses as much as digits as its factorization.
20090915101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 28.
The spelling of 20090915101 in words is "twenty billion, ninety million, nine hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •