Base | Representation |
---|---|
bin | 1001000110100011101101… |
… | …00011000100000001010101 |
3 | 2121212120011211210212100000 |
4 | 10203101312203010001111 |
5 | 10110422331321033412 |
6 | 110323245300441513 |
7 | 4134101301666003 |
oct | 443216643040125 |
9 | 77776154725300 |
10 | 20016536502357 |
11 | 6417a6903100a |
12 | 22b34096a9299 |
13 | b22722262885 |
14 | 4d2b3c567a73 |
15 | 24aa21a054dc |
hex | 1234768c4055 |
20016536502357 has 24 divisors (see below), whose sum is σ = 31017536353440. Its totient is φ = 12884207399280.
The previous prime is 20016536502353. The next prime is 20016536502397. The reversal of 20016536502357 is 75320563561002.
20016536502357 is a `hidden beast` number, since 2 + 0 + 0 + 1 + 65 + 36 + 502 + 3 + 57 = 666.
It is not a de Polignac number, because 20016536502357 - 22 = 20016536502353 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20016536502353) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1420209819 + ... + 1420223912.
It is an arithmetic number, because the mean of its divisors is an integer number (1292397348060).
Almost surely, 220016536502357 is an apocalyptic number.
20016536502357 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
20016536502357 is a deficient number, since it is larger than the sum of its proper divisors (11000999851083).
20016536502357 is an equidigital number, since it uses as much as digits as its factorization.
20016536502357 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2840433775 (or 2840433763 counting only the distinct ones).
The product of its (nonzero) digits is 1134000, while the sum is 45.
The spelling of 20016536502357 in words is "twenty trillion, sixteen billion, five hundred thirty-six million, five hundred two thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •