Base | Representation |
---|---|
bin | 1001011100000101010100… |
… | …00110000111110010100001 |
3 | 2201111021012210012020000001 |
4 | 10232002222012013302201 |
5 | 10210032031220041021 |
6 | 112051123114300001 |
7 | 4241403251333101 |
oct | 456025206076241 |
9 | 81437183166001 |
10 | 20756135705761 |
11 | 668269a549295 |
12 | 23b2817a27601 |
13 | b773ab722001 |
14 | 51a860b09201 |
15 | 25edac2c5091 |
hex | 12e0aa187ca1 |
20756135705761 has 4 divisors (see below), whose sum is σ = 20756150330800. Its totient is φ = 20756121080724.
The previous prime is 20756135705699. The next prime is 20756135705797. The reversal of 20756135705761 is 16750753165702.
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 20756135705761 - 217 = 20756135574689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20756135703761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4923531 + ... + 8108848.
It is an arithmetic number, because the mean of its divisors is an integer number (5189037582700).
Almost surely, 220756135705761 is an apocalyptic number.
It is an amenable number.
20756135705761 is a deficient number, since it is larger than the sum of its proper divisors (14625039).
20756135705761 is a wasteful number, since it uses less digits than its factorization.
20756135705761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14625038.
The product of its (nonzero) digits is 9261000, while the sum is 55.
The spelling of 20756135705761 in words is "twenty trillion, seven hundred fifty-six billion, one hundred thirty-five million, seven hundred five thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •