Base | Representation |
---|---|
bin | 1001000110000101010011… |
… | …00010000110111111100101 |
3 | 2121211000001011102022002120 |
4 | 10203002221202012333211 |
5 | 10110140413234134341 |
6 | 110311545350300153 |
7 | 4132652620124355 |
oct | 443025142067745 |
9 | 77730034368076 |
10 | 20000212021221 |
11 | 6411051310793 |
12 | 22b0212657659 |
13 | b210201b9893 |
14 | 4d203048cb65 |
15 | 24a3b87b7066 |
hex | 1230a9886fe5 |
20000212021221 has 8 divisors (see below), whose sum is σ = 28070473012320. Its totient is φ = 12631712855472.
The previous prime is 20000212021211. The next prime is 20000212021243. The reversal of 20000212021221 is 12212021200002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20000212021221 - 226 = 20000144912357 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20000212021221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000212021211) 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, 175440456270 + ... + 175440456383.
It is an arithmetic number, because the mean of its divisors is an integer number (3508809126540).
Almost surely, 220000212021221 is an apocalyptic number.
It is an amenable number.
20000212021221 is a deficient number, since it is larger than the sum of its proper divisors (8070260991099).
20000212021221 is a wasteful number, since it uses less digits than its factorization.
20000212021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350880912675.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20000212021221 its reverse (12212021200002), we get a palindrome (32212233221223).
The spelling of 20000212021221 in words is "twenty trillion, two hundred twelve million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •