Base | Representation |
---|---|
bin | 1001001110011100101010… |
… | …10010100000000100110001 |
3 | 2122211110221011211022112001 |
4 | 10213032111102200010301 |
5 | 10124343034102203121 |
6 | 111052002210334001 |
7 | 4162506340566526 |
oct | 447162522400461 |
9 | 78743834738461 |
10 | 20287635194161 |
11 | 6511a35195735 |
12 | 2337a67b8a301 |
13 | b4216750c78a |
14 | 501cd913d14d |
15 | 252adbc63991 |
hex | 1273954a0131 |
20287635194161 has 2 divisors, whose sum is σ = 20287635194162. Its totient is φ = 20287635194160.
The previous prime is 20287635194063. The next prime is 20287635194213. The reversal of 20287635194161 is 16149153678202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14780610837136 + 5507024357025 = 3844556^2 + 2346705^2 .
It is a cyclic number.
It is not a de Polignac number, because 20287635194161 - 217 = 20287635063089 is a prime.
It is a super-3 number, since 3×202876351941613 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (20287635194461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10143817597080 + 10143817597081.
It is an arithmetic number, because the mean of its divisors is an integer number (10143817597081).
It is a 1-persistent number, because it is pandigital, but 2⋅20287635194161 = 40575270388322 is not.
Almost surely, 220287635194161 is an apocalyptic number.
It is an amenable number.
20287635194161 is a deficient number, since it is larger than the sum of its proper divisors (1).
20287635194161 is an equidigital number, since it uses as much as digits as its factorization.
20287635194161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4354560, while the sum is 55.
The spelling of 20287635194161 in words is "twenty trillion, two hundred eighty-seven billion, six hundred thirty-five million, one hundred ninety-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •