Base | Representation |
---|---|
bin | 1001001001000001000011… |
… | …01000100010101011100110 |
3 | 2122011122020000220012122022 |
4 | 10210200201220202223212 |
5 | 10113313332333034342 |
6 | 110430135503103142 |
7 | 4143151540155131 |
oct | 444404150425346 |
9 | 78148200805568 |
10 | 20101011221222 |
11 | 644a877890658 |
12 | 2307863ba1ab2 |
13 | b2a69545c019 |
14 | 4d6c7370b218 |
15 | 24cd17c6b9d2 |
hex | 124821a22ae6 |
20101011221222 has 8 divisors (see below), whose sum is σ = 30151535904000. Its totient is φ = 10050499253224.
The previous prime is 20101011221219. The next prime is 20101011221257. The reversal of 20101011221222 is 22212211010102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 20101011221222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4189304 + ... + 7599492.
It is an arithmetic number, because the mean of its divisors is an integer number (3768941988000).
Almost surely, 220101011221222 is an apocalyptic number.
20101011221222 is a deficient number, since it is larger than the sum of its proper divisors (10050524682778).
20101011221222 is a wasteful number, since it uses less digits than its factorization.
20101011221222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6357390.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20101011221222 its reverse (22212211010102), we get a palindrome (42313222231324).
It can be divided in two parts, 2010101 and 1221222, that added together give a palindrome (3231323).
The spelling of 20101011221222 in words is "twenty trillion, one hundred one billion, eleven million, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •