Base | Representation |
---|---|
bin | 1010000000010011000001… |
… | …0100110100111010000010 |
3 | 1102221121111101102000011102 |
4 | 2200010300110310322002 |
5 | 2420211423313323020 |
6 | 35221233210014402 |
7 | 2213511520223621 |
oct | 240046024647202 |
9 | 42847441360142 |
10 | 11000222011010 |
11 | 3561193606091 |
12 | 1297b00117402 |
13 | 61a416416c0b |
14 | 2a05b0c476b8 |
15 | 14121ae10475 |
hex | a0130534e82 |
11000222011010 has 32 divisors (see below), whose sum is σ = 20224037256192. Its totient is φ = 4305968890560.
The previous prime is 11000222011003. The next prime is 11000222011117. The reversal of 11000222011010 is 1011022200011.
It is a super-2 number, since 2×110002220110102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11000222010982 and 11000222011000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2695700 + ... + 5409920.
It is an arithmetic number, because the mean of its divisors is an integer number (632001164256).
Almost surely, 211000222011010 is an apocalyptic number.
11000222011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11000222011010 is a deficient number, since it is larger than the sum of its proper divisors (9223815245182).
11000222011010 is a wasteful number, since it uses less digits than its factorization.
11000222011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2722898.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11000222011010 its reverse (1011022200011), we get a palindrome (12011244211021).
The spelling of 11000222011010 in words is "eleven trillion, two hundred twenty-two million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •