Base | Representation |
---|---|
bin | 1001001011111001110101… |
… | …00010001011011001110101 |
3 | 2122112010021120222110101210 |
4 | 10211330322202023121311 |
5 | 10121430014041344341 |
6 | 110543503322312033 |
7 | 4153263054301152 |
oct | 445747242133165 |
9 | 78463246873353 |
10 | 20200213231221 |
11 | 6488953828a91 |
12 | 2322b2a658619 |
13 | b36b4484071a |
14 | 4db9a47a7229 |
15 | 2506c1dc9c16 |
hex | 125f3a88b675 |
20200213231221 has 8 divisors (see below), whose sum is σ = 26939344561920. Its totient is φ = 13463945360672.
The previous prime is 20200213231183. The next prime is 20200213231291. The reversal of 20200213231221 is 12213231200202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20200213231221 - 26 = 20200213231157 is a prime.
It is a super-2 number, since 2×202002132312212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20200213231291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 715848576 + ... + 715876793.
It is an arithmetic number, because the mean of its divisors is an integer number (3367418070240).
Almost surely, 220200213231221 is an apocalyptic number.
It is an amenable number.
20200213231221 is a deficient number, since it is larger than the sum of its proper divisors (6739131330699).
20200213231221 is a wasteful number, since it uses less digits than its factorization.
20200213231221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1431730075.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 20200213231221 its reverse (12213231200202), we get a palindrome (32413444431423).
The spelling of 20200213231221 in words is "twenty trillion, two hundred billion, two hundred thirteen million, two hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •