Base | Representation |
---|---|
bin | 1001000110110110100111… |
… | …01111110100111100100001 |
3 | 2121220112101110112020122121 |
4 | 10203123103233310330201 |
5 | 10111104130124023121 |
6 | 110332045010504241 |
7 | 4134611022564004 |
oct | 443332357647441 |
9 | 77815343466577 |
10 | 20026690064161 |
11 | 64212a94a0300 |
12 | 22b5381b95081 |
13 | b2367c9c8201 |
14 | 4d3422c6153b |
15 | 24ae180e8141 |
hex | 1236d3bf4f21 |
20026690064161 has 27 divisors (see below), whose sum is σ = 22322489631897. Its totient is φ = 17953461408960.
The previous prime is 20026690064113. The next prime is 20026690064233. The reversal of 20026690064161 is 16146009662002.
The square root of 20026690064161 is 4475119.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 4751881174161 + 15274808890000 = 2179881^2 + 3908300^2 .
It is not a de Polignac number, because 20026690064161 - 27 = 20026690064033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20026690064861) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 3593517771 + ... + 3593523343.
Almost surely, 220026690064161 is an apocalyptic number.
20026690064161 is the 4475119-th square number.
20026690064161 is the 2237560-th centered octagonal number.
It is an amenable number.
20026690064161 is a deficient number, since it is larger than the sum of its proper divisors (2295799567736).
20026690064161 is an frugal number, since it uses more digits than its factorization.
20026690064161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11314 (or 5657 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 43.
The spelling of 20026690064161 in words is "twenty trillion, twenty-six billion, six hundred ninety million, sixty-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •