Base | Representation |
---|---|
bin | 1001001001011110010010… |
… | …01011111101001000111001 |
3 | 2122020010201220122121220122 |
4 | 10210233021023331020321 |
5 | 10114043004020422333 |
6 | 110441253202303025 |
7 | 4144245520614632 |
oct | 444571113751071 |
9 | 78203656577818 |
10 | 20116707201593 |
11 | 64564a1856a62 |
12 | 230a904657a75 |
13 | b2bcc723a982 |
14 | 4d7922140889 |
15 | 24d435c0c798 |
hex | 124bc92fd239 |
20116707201593 has 2 divisors, whose sum is σ = 20116707201594. Its totient is φ = 20116707201592.
The previous prime is 20116707201587. The next prime is 20116707201629. The reversal of 20116707201593 is 39510270761102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17135518203049 + 2981188998544 = 4139507^2 + 1726612^2 .
It is a cyclic number.
It is not a de Polignac number, because 20116707201593 - 220 = 20116706153017 is a prime.
It is not a weakly prime, because it can be changed into another prime (20116707201523) 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, 10058353600796 + 10058353600797.
It is an arithmetic number, because the mean of its divisors is an integer number (10058353600797).
Almost surely, 220116707201593 is an apocalyptic number.
It is an amenable number.
20116707201593 is a deficient number, since it is larger than the sum of its proper divisors (1).
20116707201593 is an equidigital number, since it uses as much as digits as its factorization.
20116707201593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 158760, while the sum is 44.
Adding to 20116707201593 its reverse (39510270761102), we get a palindrome (59626977962695).
The spelling of 20116707201593 in words is "twenty trillion, one hundred sixteen billion, seven hundred seven million, two hundred one thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •