Base | Representation |
---|---|
bin | 1010000000110111110111… |
… | …0000010111010011010010 |
3 | 1102222120000120022012112100 |
4 | 2200031331300113103102 |
5 | 2420342201404310002 |
6 | 35225550345341230 |
7 | 2214311546304516 |
oct | 240157560272322 |
9 | 42876016265470 |
10 | 11010111010002 |
11 | 35653a86a5425 |
12 | 12999bba97816 |
13 | 61b33110b500 |
14 | 2a0c6c354146 |
15 | 1415e919411c |
hex | a037dc174d2 |
11010111010002 has 36 divisors (see below), whose sum is σ = 25831414299834. Its totient is φ = 3387726463680.
The previous prime is 11010111009973. The next prime is 11010111010009. The reversal of 11010111010002 is 20001011101011.
It can be written as a sum of positive squares in 3 ways, for example, as 4698615481641 + 6311495528361 = 2167629^2 + 2512269^2 .
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 (11010111010009) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1809679899 + ... + 1809685982.
Almost surely, 211010111010002 is an apocalyptic number.
11010111010002 is an abundant number, since it is smaller than the sum of its proper divisors (14821303289832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010111010002 is a wasteful number, since it uses less digits than its factorization.
11010111010002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3619365915 (or 3619365899 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11010111010002 its reverse (20001011101011), we get a palindrome (31011122111013).
The spelling of 11010111010002 in words is "eleven trillion, ten billion, one hundred eleven million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •