Base | Representation |
---|---|
bin | 1010001101001001100001… |
… | …0100001101000000001010 |
3 | 1110201201101110222110110212 |
4 | 2203102120110031000022 |
5 | 2432321112030310442 |
6 | 35510505535041122 |
7 | 2235456042236213 |
oct | 243223024150012 |
9 | 43651343873425 |
10 | 11221010010122 |
11 | 363689268a740 |
12 | 13128596701a2 |
13 | 6351a1451383 |
14 | 2ab157b3440a |
15 | 146d3e3a6a82 |
hex | a349850d00a |
11221010010122 has 16 divisors (see below), whose sum is σ = 18361716829344. Its totient is φ = 5100441294000.
The previous prime is 11221010010113. The next prime is 11221010010131. The reversal of 11221010010122 is 22101001012211.
It is an interprime number because it is at equal distance from previous prime (11221010010113) and next prime (11221010010131).
It is a super-2 number, since 2×112210100101222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11221010010097 and 11221010010106.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7184297 + ... + 8605587.
It is an arithmetic number, because the mean of its divisors is an integer number (1147607301834).
Almost surely, 211221010010122 is an apocalyptic number.
11221010010122 is a deficient number, since it is larger than the sum of its proper divisors (7140706819222).
11221010010122 is a wasteful number, since it uses less digits than its factorization.
11221010010122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1780165.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11221010010122 its reverse (22101001012211), we get a palindrome (33322011022333).
It can be divided in two parts, 11 and 221010010122, that multiplied together give a palindrome (2431110111342).
The spelling of 11221010010122 in words is "eleven trillion, two hundred twenty-one billion, ten million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •