Base | Representation |
---|---|
bin | 1001001001111101010010… |
… | …00010101010110111000101 |
3 | 2122021201200121210212110211 |
4 | 10210332221002222313011 |
5 | 10114331044012000301 |
6 | 110453044323315421 |
7 | 4145405061232042 |
oct | 444765102526705 |
9 | 78251617725424 |
10 | 20133347765701 |
11 | 6462560a36085 |
12 | 2311b8951bb71 |
13 | b30749923001 |
14 | 4d86601b81c9 |
15 | 24daaba85051 |
hex | 124fa90aadc5 |
20133347765701 has 4 divisors (see below), whose sum is σ = 21317662340172. Its totient is φ = 18949033191232.
The previous prime is 20133347765693. The next prime is 20133347765711. The reversal of 20133347765701 is 10756774333102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10512029435076 + 9621318330625 = 3242226^2 + 3101825^2 .
It is a cyclic number.
It is not a de Polignac number, because 20133347765701 - 23 = 20133347765693 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20133347765711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 592157287210 + ... + 592157287243.
It is an arithmetic number, because the mean of its divisors is an integer number (5329415585043).
Almost surely, 220133347765701 is an apocalyptic number.
It is an amenable number.
20133347765701 is a deficient number, since it is larger than the sum of its proper divisors (1184314574471).
20133347765701 is a wasteful number, since it uses less digits than its factorization.
20133347765701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1184314574470.
The product of its (nonzero) digits is 2222640, while the sum is 49.
The spelling of 20133347765701 in words is "twenty trillion, one hundred thirty-three billion, three hundred forty-seven million, seven hundred sixty-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •