Base | Representation |
---|---|
bin | 1001001100100011101001… |
… | …0111010011011010000001 |
3 | 1022210122010010102002221110 |
4 | 2103020322113103122001 |
5 | 2311131002020431423 |
6 | 33301025404313533 |
7 | 2062343144425032 |
oct | 223107227233201 |
9 | 38718103362843 |
10 | 10111332202113 |
11 | 324921247630a |
12 | 11737888428a9 |
13 | 5846576567ac |
14 | 26d569216a89 |
15 | 128043e8c193 |
hex | 9323a5d3681 |
10111332202113 has 8 divisors (see below), whose sum is σ = 13484870566528. Its totient is φ = 6739340986224.
The previous prime is 10111332202099. The next prime is 10111332202133. The reversal of 10111332202113 is 31120223311101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10111332202113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10111332202113.
It is not an unprimeable number, because it can be changed into a prime (10111332202133) 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, 386771881 + ... + 386798022.
It is an arithmetic number, because the mean of its divisors is an integer number (1685608820816).
Almost surely, 210111332202113 is an apocalyptic number.
It is an amenable number.
10111332202113 is a deficient number, since it is larger than the sum of its proper divisors (3373538364415).
10111332202113 is an equidigital number, since it uses as much as digits as its factorization.
10111332202113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 773574263.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 10111332202113 its reverse (31120223311101), we get a palindrome (41231555513214).
The spelling of 10111332202113 in words is "ten trillion, one hundred eleven billion, three hundred thirty-two million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •