Base | Representation |
---|---|
bin | 1001000110001100011001… |
… | …0000100111110001111111 |
3 | 1022102011221021121110212202 |
4 | 2101203012100213301333 |
5 | 2302333104042023403 |
6 | 33134505432422115 |
7 | 2051423064120443 |
oct | 221430620476177 |
9 | 38364837543782 |
10 | 10002010111103 |
11 | 3206912a5726a |
12 | 1156558b4793b |
13 | 577254732b8a |
14 | 26815809a823 |
15 | 125296651688 |
hex | 918c6427c7f |
10002010111103 has 4 divisors (see below), whose sum is σ = 10002098319360. Its totient is φ = 10001921902848.
The previous prime is 10002010111081. The next prime is 10002010111183. The reversal of 10002010111103 is 30111101020001.
It is a happy number.
10002010111103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10002010111103 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 (10002010111183) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43933823 + ... + 44160896.
It is an arithmetic number, because the mean of its divisors is an integer number (2500524579840).
Almost surely, 210002010111103 is an apocalyptic number.
10002010111103 is a deficient number, since it is larger than the sum of its proper divisors (88208257).
10002010111103 is an equidigital number, since it uses as much as digits as its factorization.
10002010111103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88208256.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 10002010111103 its reverse (30111101020001), we get a palindrome (40113111131104).
The spelling of 10002010111103 in words is "ten trillion, two billion, ten million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •