Base | Representation |
---|---|
bin | 1001001001111011100001… |
… | …01111100011111110111111 |
3 | 2122021122020210111121210012 |
4 | 10210331300233203332333 |
5 | 10114322130211421303 |
6 | 110452410502533435 |
7 | 4145342501645366 |
oct | 444756057437677 |
9 | 78248223447705 |
10 | 20132403232703 |
11 | 64621168574a3 |
12 | 231196513727b |
13 | b30629036748 |
14 | 4d85b09887dd |
15 | 24da53bad5d8 |
hex | 124f70be3fbf |
20132403232703 has 2 divisors, whose sum is σ = 20132403232704. Its totient is φ = 20132403232702.
The previous prime is 20132403232699. The next prime is 20132403232729. The reversal of 20132403232703 is 30723230423102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20132403232703 - 22 = 20132403232699 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20132403232703.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20132403234703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10066201616351 + 10066201616352.
It is an arithmetic number, because the mean of its divisors is an integer number (10066201616352).
Almost surely, 220132403232703 is an apocalyptic number.
20132403232703 is a deficient number, since it is larger than the sum of its proper divisors (1).
20132403232703 is an equidigital number, since it uses as much as digits as its factorization.
20132403232703 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 32.
Adding to 20132403232703 its reverse (30723230423102), we get a palindrome (50855633655805).
The spelling of 20132403232703 in words is "twenty trillion, one hundred thirty-two billion, four hundred three million, two hundred thirty-two thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •