Base | Representation |
---|---|
bin | 10010101111111101… |
… | …100001110100101101 |
3 | 1220222000221010201111 |
4 | 102233331201310231 |
5 | 312212243330214 |
6 | 13125402512021 |
7 | 1311614162344 |
oct | 225775416455 |
9 | 56860833644 |
10 | 20132011309 |
11 | 85a0aa5083 |
12 | 3a9a205611 |
13 | 1b8ab48a37 |
14 | d8da4ab5b |
15 | 7cc6455c4 |
hex | 4aff61d2d |
20132011309 has 2 divisors, whose sum is σ = 20132011310. Its totient is φ = 20132011308.
The previous prime is 20132011253. The next prime is 20132011313. The reversal of 20132011309 is 90311023102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11262515625 + 8869495684 = 106125^2 + 94178^2 .
It is a cyclic number.
It is not a de Polignac number, because 20132011309 - 231 = 17984527661 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20132011309.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20132011709) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10066005654 + 10066005655.
It is an arithmetic number, because the mean of its divisors is an integer number (10066005655).
Almost surely, 220132011309 is an apocalyptic number.
It is an amenable number.
20132011309 is a deficient number, since it is larger than the sum of its proper divisors (1).
20132011309 is an equidigital number, since it uses as much as digits as its factorization.
20132011309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
The spelling of 20132011309 in words is "twenty billion, one hundred thirty-two million, eleven thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •