Base | Representation |
---|---|
bin | 1001010001110010100000… |
… | …1010010001110101010010 |
3 | 1100010020010122020210212122 |
4 | 2110130220022101311102 |
5 | 2314114100101023442 |
6 | 33410213135454242 |
7 | 2102004524514116 |
oct | 224345012216522 |
9 | 40106118223778 |
10 | 10201221111122 |
11 | 328334a410068 |
12 | 1189094387382 |
13 | 58cc81450c52 |
14 | 273a55477746 |
15 | 12a5556c2dd2 |
hex | 94728291d52 |
10201221111122 has 8 divisors (see below), whose sum is σ = 16201939411836. Its totient is φ = 4800574640512.
The previous prime is 10201221111089. The next prime is 10201221111163. The reversal of 10201221111122 is 22111112210201.
It can be written as a sum of positive squares in 2 ways, for example, as 9859593720001 + 341627391121 = 3139999^2 + 584489^2 .
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 (17).
It is a self number, because there is not a number n which added to its sum of digits gives 10201221111122.
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, 150017957483 + ... + 150017957550.
Almost surely, 210201221111122 is an apocalyptic number.
10201221111122 is a deficient number, since it is larger than the sum of its proper divisors (6000718300714).
10201221111122 is a wasteful number, since it uses less digits than its factorization.
10201221111122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300035915052.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10201221111122 its reverse (22111112210201), we get a palindrome (32312333321323).
It can be divided in two parts, 10201 and 221111122, that multiplied together give a palindrome (2255554555522).
The spelling of 10201221111122 in words is "ten trillion, two hundred one billion, two hundred twenty-one million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •