Base | Representation |
---|---|
bin | 10010101110110000… |
… | …000100100111001010 |
3 | 1220220121201112212010 |
4 | 102232300010213022 |
5 | 312142044102240 |
6 | 13123355400350 |
7 | 1311246454014 |
oct | 225660044712 |
9 | 56817645763 |
10 | 20111706570 |
11 | 85905968aa |
12 | 3a934530b6 |
13 | 1b868899b7 |
14 | d8b0831b4 |
15 | 7ca984280 |
hex | 4aec049ca |
20111706570 has 32 divisors (see below), whose sum is σ = 48272425920. Its totient is φ = 5362640640.
The previous prime is 20111706553. The next prime is 20111706577. The reversal of 20111706570 is 7560711102.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20111706577) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 420690 + ... + 466050.
It is an arithmetic number, because the mean of its divisors is an integer number (1508513310).
Almost surely, 220111706570 is an apocalyptic number.
20111706570 is an abundant number, since it is smaller than the sum of its proper divisors (28160719350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111706570 is a wasteful number, since it uses less digits than its factorization.
20111706570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60150.
The product of its (nonzero) digits is 2940, while the sum is 30.
The spelling of 20111706570 in words is "twenty billion, one hundred eleven million, seven hundred six thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •