Base | Representation |
---|---|
bin | 10010101100100110… |
… | …110011000110001110 |
3 | 1220211010000022002000 |
4 | 102230212303012032 |
5 | 312103341033402 |
6 | 13120032213130 |
7 | 1310331546063 |
oct | 225446630616 |
9 | 56733008060 |
10 | 20075721102 |
11 | 8572248448 |
12 | 3a8339a1a6 |
13 | 1b7c29a518 |
14 | d86396c6a |
15 | 7c7726c1c |
hex | 4ac9b318e |
20075721102 has 32 divisors (see below), whose sum is σ = 45344076960. Its totient is φ = 6582202560.
The previous prime is 20075721101. The next prime is 20075721103. The reversal of 20075721102 is 20112757002.
It is an interprime number because it is at equal distance from previous prime (20075721101) and next prime (20075721103).
It is a super-3 number, since 3×200757211023 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20075721101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3044023 + ... + 3050610.
It is an arithmetic number, because the mean of its divisors is an integer number (1417002405).
Almost surely, 220075721102 is an apocalyptic number.
20075721102 is an abundant number, since it is smaller than the sum of its proper divisors (25268355858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20075721102 is a wasteful number, since it uses less digits than its factorization.
20075721102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6094705 (or 6094699 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The spelling of 20075721102 in words is "twenty billion, seventy-five million, seven hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •