Base | Representation |
---|---|
bin | 10010101000101100… |
… | …110111000000010111 |
3 | 1220122112201112112200 |
4 | 102220230313000113 |
5 | 311440102413421 |
6 | 13105332015543 |
7 | 1305604621515 |
oct | 225054670027 |
9 | 56575645480 |
10 | 20010201111 |
11 | 853926729a |
12 | 3a654615b3 |
13 | 1b6b839bb4 |
14 | d7b7bd4b5 |
15 | 7c1ad3726 |
hex | 4a8b37017 |
20010201111 has 6 divisors (see below), whose sum is σ = 28903623840. Its totient is φ = 13340134068.
The previous prime is 20010201037. The next prime is 20010201121. The reversal of 20010201111 is 11110201002.
It is a happy number.
It is not a de Polignac number, because 20010201111 - 211 = 20010199063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 2223355679 = 20010201111 / (2 + 0 + 0 + 1 + 0 + 2 + 0 + 1 + 1 + 1 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 20010201093 and 20010201102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010201121) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1111677831 + ... + 1111677848.
It is an arithmetic number, because the mean of its divisors is an integer number (4817270640).
Almost surely, 220010201111 is an apocalyptic number.
20010201111 is a deficient number, since it is larger than the sum of its proper divisors (8893422729).
20010201111 is a wasteful number, since it uses less digits than its factorization.
20010201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2223355685 (or 2223355682 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20010201111 its reverse (11110201002), we get a palindrome (31120402113).
The spelling of 20010201111 in words is "twenty billion, ten million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •