Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0110001010001000110010 |
3 | 1102222122100020010012212100 |
4 | 2200032303112022020302 |
5 | 2420401022042010002 |
6 | 35230215504241230 |
7 | 2214343044444360 |
oct | 240166326121062 |
9 | 42878306105770 |
10 | 11011010110002 |
11 | 356581a172581 |
12 | 129a011010216 |
13 | 61b44547b346 |
14 | 2a0d15918630 |
15 | 14164d09411c |
hex | a03b358a232 |
11011010110002 has 48 divisors (see below), whose sum is σ = 27265723235712. Its totient is φ = 3145960788480.
The previous prime is 11011010109937. The next prime is 11011010110007. The reversal of 11011010110002 is 20001101011011.
It is a super-2 number, since 2×110110101100022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11011010110007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9564498 + ... + 10653714.
It is an arithmetic number, because the mean of its divisors is an integer number (568035900744).
Almost surely, 211011010110002 is an apocalyptic number.
11011010110002 is an abundant number, since it is smaller than the sum of its proper divisors (16254713125710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011010110002 is a wasteful number, since it uses less digits than its factorization.
11011010110002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1169463 (or 1169460 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11011010110002 its reverse (20001101011011), we get a palindrome (31012111121013).
The spelling of 11011010110002 in words is "eleven trillion, eleven billion, ten million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •