Base | Representation |
---|---|
bin | 1001000110000110111110… |
… | …01011010010110111101110 |
3 | 2121211002100212220110220112 |
4 | 10203003133023102313232 |
5 | 10110144234133311342 |
6 | 110312214540220022 |
7 | 4133014125656120 |
oct | 443033713226756 |
9 | 77732325813815 |
10 | 20001112010222 |
11 | 6411473335852 |
12 | 22b0423b3a612 |
13 | b211347ab255 |
14 | 4d20b7c05210 |
15 | 24a41c7e0682 |
hex | 1230df2d2dee |
20001112010222 has 8 divisors (see below), whose sum is σ = 34287620588976. Its totient is φ = 8571905147232.
The previous prime is 20001112010179. The next prime is 20001112010237. The reversal of 20001112010222 is 22201021110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 1428650857873 = 20001112010222 / (2 + 0 + 0 + 0 + 1 + 1 + 1 + 2 + 0 + 1 + 0 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 20001112010197 and 20001112010206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 714325428923 + ... + 714325428950.
It is an arithmetic number, because the mean of its divisors is an integer number (4285952573622).
Almost surely, 220001112010222 is an apocalyptic number.
20001112010222 is a deficient number, since it is larger than the sum of its proper divisors (14286508578754).
20001112010222 is a wasteful number, since it uses less digits than its factorization.
20001112010222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1428650857882.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20001112010222 its reverse (22201021110002), we get a palindrome (42202133120224).
The spelling of 20001112010222 in words is "twenty trillion, one billion, one hundred twelve million, ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.361 sec. • engine limits •