Base | Representation |
---|---|
bin | 1001011100111001011000… |
… | …00000100111110110101101 |
3 | 2201120221100121220212110022 |
4 | 10232130230000213312231 |
5 | 10211011301241343333 |
6 | 112112024335051525 |
7 | 4243413001324211 |
oct | 456345400476655 |
9 | 81527317825408 |
10 | 20784085106093 |
11 | 6693532225451 |
12 | 23b8118070ba5 |
13 | b79c1400470a |
14 | 51bd52a86941 |
15 | 260995d93c98 |
hex | 12e72c027dad |
20784085106093 has 2 divisors, whose sum is σ = 20784085106094. Its totient is φ = 20784085106092.
The previous prime is 20784085106069. The next prime is 20784085106123. The reversal of 20784085106093 is 39060158048702.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20782775968969 + 1309137124 = 4558813^2 + 36182^2 .
It is a cyclic number.
It is not a de Polignac number, because 20784085106093 - 228 = 20783816670637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20784085106023) 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, 10392042553046 + 10392042553047.
It is an arithmetic number, because the mean of its divisors is an integer number (10392042553047).
It is a 1-persistent number, because it is pandigital, but 2⋅20784085106093 = 41568170212186 is not.
Almost surely, 220784085106093 is an apocalyptic number.
It is an amenable number.
20784085106093 is a deficient number, since it is larger than the sum of its proper divisors (1).
20784085106093 is an equidigital number, since it uses as much as digits as its factorization.
20784085106093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 20784085106093 in words is "twenty trillion, seven hundred eighty-four billion, eighty-five million, one hundred six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •