Base | Representation |
---|---|
bin | 10010101001010110… |
… | …111011111001101101 |
3 | 1220200022110220222222 |
4 | 102221112323321231 |
5 | 312000413344323 |
6 | 13110404245125 |
7 | 1306100441324 |
oct | 225126737155 |
9 | 56608426888 |
10 | 20021231213 |
11 | 8544510385 |
12 | 3a690a07a5 |
13 | 1b70bcc599 |
14 | d7d0510bb |
15 | 7c2a619c8 |
hex | 4a95bbe6d |
20021231213 has 4 divisors (see below), whose sum is σ = 20023454748. Its totient is φ = 20019007680.
The previous prime is 20021231203. The next prime is 20021231231. The reversal of 20021231213 is 31213212002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12813560809 + 7207670404 = 113197^2 + 84898^2 .
It is a cyclic number.
It is not a de Polignac number, because 20021231213 - 210 = 20021230189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20021231191 and 20021231200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021231203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1098206 + ... + 1116287.
It is an arithmetic number, because the mean of its divisors is an integer number (5005863687).
Almost surely, 220021231213 is an apocalyptic number.
It is an amenable number.
20021231213 is a deficient number, since it is larger than the sum of its proper divisors (2223535).
20021231213 is an equidigital number, since it uses as much as digits as its factorization.
20021231213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2223534.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20021231213 its reverse (31213212002), we get a palindrome (51234443215).
The spelling of 20021231213 in words is "twenty billion, twenty-one million, two hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •