Base | Representation |
---|---|
bin | 1001001001010110000111… |
… | …01100100000001101011001 |
3 | 2122012201102011112221101002 |
4 | 10210223003230200031121 |
5 | 10114010012421301012 |
6 | 110435250003434345 |
7 | 4144032020112524 |
oct | 444530354401531 |
9 | 78181364487332 |
10 | 20112320103257 |
11 | 645465040a058 |
12 | 2309a9b3859b5 |
13 | b2b7783741b5 |
14 | 4d7627623bbb |
15 | 24d27a9c17c2 |
hex | 124ac3b20359 |
20112320103257 has 2 divisors, whose sum is σ = 20112320103258. Its totient is φ = 20112320103256.
The previous prime is 20112320103223. The next prime is 20112320103277. The reversal of 20112320103257 is 75230102321102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16856969564176 + 3255350539081 = 4105724^2 + 1804259^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112320103257 - 240 = 19012808475481 is a prime.
It is not a weakly prime, because it can be changed into another prime (20112320103277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056160051628 + 10056160051629.
It is an arithmetic number, because the mean of its divisors is an integer number (10056160051629).
Almost surely, 220112320103257 is an apocalyptic number.
It is an amenable number.
20112320103257 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112320103257 is an equidigital number, since it uses as much as digits as its factorization.
20112320103257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 20112320103257 its reverse (75230102321102), we get a palindrome (95342422424359).
The spelling of 20112320103257 in words is "twenty trillion, one hundred twelve billion, three hundred twenty million, one hundred three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.622 sec. • engine limits •