Base | Representation |
---|---|
bin | 1001010000000111100100… |
… | …00010011111011101111101 |
3 | 2200000222001211110212112111 |
4 | 10220003302002133131331 |
5 | 10131313103104301214 |
6 | 111134213103334021 |
7 | 4166610464260513 |
oct | 450036202373575 |
9 | 80028054425474 |
10 | 20345025853309 |
11 | 6534305778353 |
12 | 2347003bb1311 |
13 | b476b24a61a1 |
14 | 5049c123c4b3 |
15 | 25434a38d5c4 |
hex | 1280f209f77d |
20345025853309 has 2 divisors, whose sum is σ = 20345025853310. Its totient is φ = 20345025853308.
The previous prime is 20345025853307. The next prime is 20345025853337. The reversal of 20345025853309 is 90335852054302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17441665447684 + 2903360405625 = 4176322^2 + 1703925^2 .
It is a cyclic number.
It is not a de Polignac number, because 20345025853309 - 21 = 20345025853307 is a prime.
Together with 20345025853307, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20345025853307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10172512926654 + 10172512926655.
It is an arithmetic number, because the mean of its divisors is an integer number (10172512926655).
Almost surely, 220345025853309 is an apocalyptic number.
It is an amenable number.
20345025853309 is a deficient number, since it is larger than the sum of its proper divisors (1).
20345025853309 is an equidigital number, since it uses as much as digits as its factorization.
20345025853309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888000, while the sum is 49.
The spelling of 20345025853309 in words is "twenty trillion, three hundred forty-five billion, twenty-five million, eight hundred fifty-three thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •