Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0110001010011000011010 |
3 | 1102222122100020010021020101 |
4 | 2200032303112022120122 |
5 | 2420401022042023002 |
6 | 35230215504250014 |
7 | 2214343044450316 |
oct | 240166326123032 |
9 | 42878306107211 |
10 | 11011010111002 |
11 | 356581a173300 |
12 | 129a01101090a |
13 | 61b44547b935 |
14 | 2a0d15918b46 |
15 | 14164d094587 |
hex | a03b358a61a |
11011010111002 has 48 divisors (see below), whose sum is σ = 18317186545896. Its totient is φ = 4960168012800.
The previous prime is 11011010110987. The next prime is 11011010111029. The reversal of 11011010111002 is 20011101011011.
It can be written as a sum of positive squares in 4 ways, for example, as 7453331346241 + 3557678764761 = 2730079^2 + 1886181^2 .
It is a super-2 number, since 2×110110101110022 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11011010111002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 351134308 + ... + 351165664.
Almost surely, 211011010111002 is an apocalyptic number.
11011010111002 is a deficient number, since it is larger than the sum of its proper divisors (7306176434894).
11011010111002 is a wasteful number, since it uses less digits than its factorization.
11011010111002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44335 (or 44324 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 11011010111002 its reverse (20011101011011), we get a palindrome (31022111122013).
Subtracting 11011010111002 from its reverse (20011101011011), we obtain a palindrome (9000090900009).
The spelling of 11011010111002 in words is "eleven trillion, eleven billion, ten million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •