Base | Representation |
---|---|
bin | 1001001100011111011110… |
… | …0110011100111110100001 |
3 | 1022210112020001202000201001 |
4 | 2103013313212130332201 |
5 | 2311121203244200001 |
6 | 33300322312512001 |
7 | 2062303323626146 |
oct | 223076746347641 |
9 | 38715201660631 |
10 | 10110212100001 |
11 | 3248798180a92 |
12 | 11735156ab601 |
13 | 584509588090 |
14 | 26d4a05643cd |
15 | 127eca985001 |
hex | 931f799cfa1 |
10110212100001 has 8 divisors (see below), whose sum is σ = 10995721919784. Its totient is φ = 9240102451200.
The previous prime is 10110212099891. The next prime is 10110212100031. The reversal of 10110212100001 is 10000121201101.
It can be written as a sum of positive squares in 4 ways, for example, as 2096081406225 + 8014130693776 = 1447785^2 + 2830924^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10110212100001 - 213 = 10110212091809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10110212100031) 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, 3850041376 + ... + 3850044001.
It is an arithmetic number, because the mean of its divisors is an integer number (1374465239973).
Almost surely, 210110212100001 is an apocalyptic number.
It is an amenable number.
10110212100001 is a deficient number, since it is larger than the sum of its proper divisors (885509819783).
10110212100001 is a wasteful number, since it uses less digits than its factorization.
10110212100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7700085491.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10110212100001 its reverse (10000121201101), we get a palindrome (20110333301102).
The spelling of 10110212100001 in words is "ten trillion, one hundred ten billion, two hundred twelve million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •