Base | Representation |
---|---|
bin | 10010101000001010… |
… | …111100010110010101 |
3 | 1220121220222211101000 |
4 | 102220022330112111 |
5 | 311430313410401 |
6 | 13104413253513 |
7 | 1305436221303 |
oct | 225012742625 |
9 | 56556884330 |
10 | 20001310101 |
11 | 8534244353 |
12 | 3a62494299 |
13 | 1b69a46046 |
14 | d7a547273 |
15 | 7c0e29186 |
hex | 4a82bc595 |
20001310101 has 32 divisors (see below), whose sum is σ = 31481896320. Its totient is φ = 12506925312.
The previous prime is 20001310099. The next prime is 20001310141. The reversal of 20001310101 is 10101310002.
It is not a de Polignac number, because 20001310101 - 21 = 20001310099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001310141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 60126 + ... + 208848.
It is an arithmetic number, because the mean of its divisors is an integer number (983809260).
Almost surely, 220001310101 is an apocalyptic number.
It is an amenable number.
20001310101 is a deficient number, since it is larger than the sum of its proper divisors (11480586219).
20001310101 is a wasteful number, since it uses less digits than its factorization.
20001310101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149042 (or 149036 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 20001310101 its reverse (10101310002), we get a palindrome (30102620103).
Subtracting from 20001310101 its reverse (10101310002), we obtain a palindrome (9900000099).
The spelling of 20001310101 in words is "twenty billion, one million, three hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •