Base | Representation |
---|---|
bin | 1001010111101101110011… |
… | …01000110100000001100111 |
3 | 2200221220212121222202001002 |
4 | 10223312321220310001213 |
5 | 10200102214041241402 |
6 | 111454144333223515 |
7 | 4224511455112013 |
oct | 453667150640147 |
9 | 80856777882032 |
10 | 20606072602727 |
11 | 6624a9386a977 |
12 | 2389718031b9b |
13 | b661b507a3a1 |
14 | 5134a6c0d543 |
15 | 25b027dcd602 |
hex | 12bdb9a34067 |
20606072602727 has 4 divisors (see below), whose sum is σ = 20756481891936. Its totient is φ = 20455663313520.
The previous prime is 20606072602721. The next prime is 20606072602741. The reversal of 20606072602727 is 72720627060602.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20606072602727 - 24 = 20606072602711 is a prime.
It is a super-2 number, since 2×206060726027272 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20606072602721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75204644399 + ... + 75204644672.
It is an arithmetic number, because the mean of its divisors is an integer number (5189120472984).
Almost surely, 220606072602727 is an apocalyptic number.
20606072602727 is a deficient number, since it is larger than the sum of its proper divisors (150409289209).
20606072602727 is a wasteful number, since it uses less digits than its factorization.
20606072602727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150409289208.
The product of its (nonzero) digits is 1185408, while the sum is 47.
The spelling of 20606072602727 in words is "twenty trillion, six hundred six billion, seventy-two million, six hundred two thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •