Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0100001111111110010010 |
3 | 1102222122022121101121110102 |
4 | 2200032302310033332102 |
5 | 2420401012303033020 |
6 | 35230214545532402 |
7 | 2214342606053060 |
oct | 240166264177622 |
9 | 42878277347412 |
10 | 11011001221010 |
11 | 35658151510aa |
12 | 129a00a044102 |
13 | 61b44368839b |
14 | 2a0d14683030 |
15 | 14164c3da475 |
hex | a03b2d0ff92 |
11011001221010 has 64 divisors (see below), whose sum is σ = 22856237524224. Its totient is φ = 3741181516800.
The previous prime is 11011001220913. The next prime is 11011001221039. The reversal of 11011001221010 is 1012210011011.
11011001221010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×110110012210103 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11011001220982 and 11011001221000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1841630 + ... + 5041190.
It is an arithmetic number, because the mean of its divisors is an integer number (357128711316).
Almost surely, 211011001221010 is an apocalyptic number.
11011001221010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011001221010 is an abundant number, since it is smaller than the sum of its proper divisors (11845236303214).
11011001221010 is a wasteful number, since it uses less digits than its factorization.
11011001221010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3200019.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011001221010 its reverse (1012210011011), we get a palindrome (12023211232021).
The spelling of 11011001221010 in words is "eleven trillion, eleven billion, one million, two hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •