Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …0111000010111111110110 |
3 | 1102221121110112211022000100 |
4 | 2200010233213002333312 |
5 | 2420211412230310402 |
6 | 35221232100454530 |
7 | 2213511313221555 |
oct | 240045747027766 |
9 | 42847415738010 |
10 | 11000210010102 |
11 | 3561187859685 |
12 | 1297ab80aa446 |
13 | 61a413aa46a1 |
14 | 2a05ad401d9c |
15 | 141219d3e71c |
hex | a012f9c2ff6 |
11000210010102 has 24 divisors (see below), whose sum is σ = 24477944798736. Its totient is φ = 3567635678736.
The previous prime is 11000210010059. The next prime is 11000210010193. The reversal of 11000210010102 is 20101001200011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8258415258 + ... + 8258416589.
It is an arithmetic number, because the mean of its divisors is an integer number (1019914366614).
Almost surely, 211000210010102 is an apocalyptic number.
11000210010102 is an abundant number, since it is smaller than the sum of its proper divisors (13477734788634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000210010102 is a wasteful number, since it uses less digits than its factorization.
11000210010102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16516831892 (or 16516831889 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11000210010102 its reverse (20101001200011), we get a palindrome (31101211210113).
The spelling of 11000210010102 in words is "eleven trillion, two hundred ten million, ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •