Base | Representation |
---|---|
bin | 1010000000110111011101… |
… | …0001101101001111010110 |
3 | 1102222112201222202200022010 |
4 | 2200031313101231033112 |
5 | 2420341441042410402 |
6 | 35225531503445050 |
7 | 2214306056336265 |
oct | 240156721551726 |
9 | 42875658680263 |
10 | 11010002310102 |
11 | 35653523015a4 |
12 | 129998b5b6786 |
13 | 61b31473cb43 |
14 | 2a0c5bb3a5dc |
15 | 1415de871a6c |
hex | a037746d3d6 |
11010002310102 has 16 divisors (see below), whose sum is σ = 22730327350272. Its totient is φ = 3551613648360.
The previous prime is 11010002310101. The next prime is 11010002310103. The reversal of 11010002310102 is 20101320001011.
It is an interprime number because it is at equal distance from previous prime (11010002310101) and next prime (11010002310103).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010002310101) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 29596780218 + ... + 29596780589.
It is an arithmetic number, because the mean of its divisors is an integer number (1420645459392).
Almost surely, 211010002310102 is an apocalyptic number.
11010002310102 is an abundant number, since it is smaller than the sum of its proper divisors (11720325040170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010002310102 is a wasteful number, since it uses less digits than its factorization.
11010002310102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59193560843.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 11010002310102 its reverse (20101320001011), we get a palindrome (31111322311113).
The spelling of 11010002310102 in words is "eleven trillion, ten billion, two million, three hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •