Base | Representation |
---|---|
bin | 10010110100000101… |
… | …111000100000000101 |
3 | 1221010212022212221120 |
4 | 102310011320200011 |
5 | 312333013411323 |
6 | 13140320104153 |
7 | 1313415206100 |
oct | 226405704005 |
9 | 57125285846 |
10 | 20201310213 |
11 | 86271273a7 |
12 | 3ab9465059 |
13 | 1b9c3003c6 |
14 | d98d29737 |
15 | 7d37835e3 |
hex | 4b4178805 |
20201310213 has 24 divisors (see below), whose sum is σ = 31558091040. Its totient is φ = 11460546720.
The previous prime is 20201310191. The next prime is 20201310223. The reversal of 20201310213 is 31201310202.
It is not a de Polignac number, because 20201310213 - 26 = 20201310149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20201310192 and 20201310201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20201310223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 473898 + ... + 514763.
It is an arithmetic number, because the mean of its divisors is an integer number (1314920460).
Almost surely, 220201310213 is an apocalyptic number.
It is an amenable number.
20201310213 is a deficient number, since it is larger than the sum of its proper divisors (11356780827).
20201310213 is a wasteful number, since it uses less digits than its factorization.
20201310213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 988817 (or 988810 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 20201310213 its reverse (31201310202), we get a palindrome (51402620415).
It can be divided in two parts, 202013 and 10213, that added together give a triangular number (212226 = T651).
The spelling of 20201310213 in words is "twenty billion, two hundred one million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •