Base | Representation |
---|---|
bin | 10011001100001110… |
… | …000101111110010111 |
3 | 1222012002001010201200 |
4 | 103030032011332113 |
5 | 314200131200420 |
6 | 13244420323543 |
7 | 1326432044112 |
oct | 231416057627 |
9 | 58162033650 |
10 | 20606115735 |
11 | 8814684817 |
12 | 3bb0b435b3 |
13 | 1c351350ba |
14 | dd69c1579 |
15 | 809095b90 |
hex | 4cc385f97 |
20606115735 has 96 divisors (see below), whose sum is σ = 39348504000. Its totient is φ = 9929084928.
The previous prime is 20606115731. The next prime is 20606115737. The reversal of 20606115735 is 53751160602.
20606115735 is a `hidden beast` number, since 2 + 0 + 6 + 0 + 611 + 5 + 7 + 35 = 666.
It is not a de Polignac number, because 20606115735 - 22 = 20606115731 is a prime.
It is a super-2 number, since 2×206061157352 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20606115735.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20606115731) 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 95 ways as a sum of consecutive naturals, for example, 3968521 + ... + 3973709.
It is an arithmetic number, because the mean of its divisors is an integer number (409880250).
Almost surely, 220606115735 is an apocalyptic number.
20606115735 is a deficient number, since it is larger than the sum of its proper divisors (18742388265).
20606115735 is a wasteful number, since it uses less digits than its factorization.
20606115735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5425 (or 5422 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The spelling of 20606115735 in words is "twenty billion, six hundred six million, one hundred fifteen thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •