Base | Representation |
---|---|
bin | 1001011100010111000011… |
… | …10111000111110011100001 |
3 | 2201112011210122011002222020 |
4 | 10232023201313013303201 |
5 | 10210211033233413403 |
6 | 112055340231332053 |
7 | 4242161305065462 |
oct | 456134167076341 |
9 | 81464718132866 |
10 | 20765661232353 |
11 | 6686738451414 |
12 | 23b4635b21029 |
13 | b7826902418b |
14 | 51b0c5c3cd69 |
15 | 2602686ad453 |
hex | 12e2e1dc7ce1 |
20765661232353 has 4 divisors (see below), whose sum is σ = 27687548309808. Its totient is φ = 13843774154900.
The previous prime is 20765661232297. The next prime is 20765661232387. The reversal of 20765661232353 is 35323216656702.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20765661232353 - 26 = 20765661232289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20765661232296 and 20765661232305.
It is not an unprimeable number, because it can be changed into a prime (20765661132353) 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, 3460943538723 + ... + 3460943538728.
It is an arithmetic number, because the mean of its divisors is an integer number (6921887077452).
Almost surely, 220765661232353 is an apocalyptic number.
It is an amenable number.
20765661232353 is a deficient number, since it is larger than the sum of its proper divisors (6921887077455).
20765661232353 is an equidigital number, since it uses as much as digits as its factorization.
20765661232353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6921887077454.
The product of its (nonzero) digits is 8164800, while the sum is 51.
The spelling of 20765661232353 in words is "twenty trillion, seven hundred sixty-five billion, six hundred sixty-one million, two hundred thirty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •