Base | Representation |
---|---|
bin | 1001000110001100101110… |
… | …0111111100001111100111 |
3 | 1022102012011112221220120202 |
4 | 2101203023213330033213 |
5 | 2302333300112012221 |
6 | 33134522405421115 |
7 | 2051425236111011 |
oct | 221431347741747 |
9 | 38365145856522 |
10 | 10002100110311 |
11 | 3206959837a81 |
12 | 115658310a79b |
13 | 57726a28464a |
14 | 2681660071b1 |
15 | 12529e4ccd0b |
hex | 918cb9fc3e7 |
10002100110311 has 8 divisors (see below), whose sum is σ = 10143190646784. Its totient is φ = 9861015570840.
The previous prime is 10002100110269. The next prime is 10002100110361. The reversal of 10002100110311 is 11301100120001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10002100110311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10002100110292 and 10002100110301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002100110361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1914410 + ... + 4865096.
It is an arithmetic number, because the mean of its divisors is an integer number (1267898830848).
Almost surely, 210002100110311 is an apocalyptic number.
10002100110311 is a deficient number, since it is larger than the sum of its proper divisors (141090536473).
10002100110311 is an equidigital number, since it uses as much as digits as its factorization.
10002100110311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2998501.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 10002100110311 its reverse (11301100120001), we get a palindrome (21303200230312).
The spelling of 10002100110311 in words is "ten trillion, two billion, one hundred million, one hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •