Base | Representation |
---|---|
bin | 1001100001010100110110… |
… | …10011000111101111101101 |
3 | 2202010111012002002110202112 |
4 | 10300222123103013233231 |
5 | 10221004443134103040 |
6 | 112305554211533405 |
7 | 4260411303300251 |
oct | 460523323075755 |
9 | 82114162073675 |
10 | 20936276081645 |
11 | 67420300499a1 |
12 | 24217105ba265 |
13 | b8b3894759c2 |
14 | 52546d406261 |
15 | 264901eab365 |
hex | 130a9b4c7bed |
20936276081645 has 32 divisors (see below), whose sum is σ = 27648406425600. Its totient is φ = 15148581332544.
The previous prime is 20936276081641. The next prime is 20936276081647. The reversal of 20936276081645 is 54618067263902.
It is a cyclic number.
It is not a de Polignac number, because 20936276081645 - 22 = 20936276081641 is a prime.
It is a super-3 number, since 3×209362760816453 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20936276081641) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8017685 + ... + 10303194.
It is an arithmetic number, because the mean of its divisors is an integer number (864012700800).
It is a 2-persistent number, because it is pandigital, and so is 2⋅20936276081645 = 41872552163290, but 3⋅20936276081645 = 62808828244935 is not.
Almost surely, 220936276081645 is an apocalyptic number.
It is an amenable number.
20936276081645 is a deficient number, since it is larger than the sum of its proper divisors (6712130343955).
20936276081645 is a wasteful number, since it uses less digits than its factorization.
20936276081645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18321449.
The product of its (nonzero) digits is 26127360, while the sum is 59.
The spelling of 20936276081645 in words is "twenty trillion, nine hundred thirty-six billion, two hundred seventy-six million, eighty-one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •