Base | Representation |
---|---|
bin | 1001001100100111010000… |
… | …1111110100110000101111 |
3 | 1022210201121210202000101201 |
4 | 2103021310033310300233 |
5 | 2311134444122220421 |
6 | 33301310014550331 |
7 | 2062406205664606 |
oct | 223116417646057 |
9 | 38721553660351 |
10 | 10112303320111 |
11 | 3249670662673 |
12 | 11739b9b083a7 |
13 | 5847808c0825 |
14 | 26d61c1a6a3d |
15 | 12809e365b91 |
hex | 932743f4c2f |
10112303320111 has 8 divisors (see below), whose sum is σ = 10211709551264. Its totient is φ = 10012920714720.
The previous prime is 10112303320099. The next prime is 10112303320121. The reversal of 10112303320111 is 11102330321101.
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 10112303320111 - 217 = 10112303189039 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112303320121) 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, 5045580 + ... + 6758881.
It is an arithmetic number, because the mean of its divisors is an integer number (1276463693908).
Almost surely, 210112303320111 is an apocalyptic number.
10112303320111 is a deficient number, since it is larger than the sum of its proper divisors (99406231153).
10112303320111 is a wasteful number, since it uses less digits than its factorization.
10112303320111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11812881.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10112303320111 its reverse (11102330321101), we get a palindrome (21214633641212).
The spelling of 10112303320111 in words is "ten trillion, one hundred twelve billion, three hundred three million, three hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •