Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …0011001110100001110101 |
3 | 1022101222202220020221122022 |
4 | 2101201033003032201311 |
5 | 2302320010042023333 |
6 | 33133535145442525 |
7 | 2051322400315562 |
oct | 221411703164165 |
9 | 38358686227568 |
10 | 10000010111093 |
11 | 3205a8700a6a2 |
12 | 115609b1a0445 |
13 | 576cc6288812 |
14 | 268008601869 |
15 | 1251cac8dc98 |
hex | 9184f0ce875 |
10000010111093 has 4 divisors (see below), whose sum is σ = 10000039322508. Its totient is φ = 9999980899680.
The previous prime is 10000010111053. The next prime is 10000010111099. The reversal of 10000010111093 is 39011101000001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5152364293924 + 4847645817169 = 2269882^2 + 2201737^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000010111093 - 26 = 10000010111029 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 (10000010111099) 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, 14086046 + ... + 14778927.
It is an arithmetic number, because the mean of its divisors is an integer number (2500009830627).
Almost surely, 210000010111093 is an apocalyptic number.
It is an amenable number.
10000010111093 is a deficient number, since it is larger than the sum of its proper divisors (29211415).
10000010111093 is an equidigital number, since it uses as much as digits as its factorization.
10000010111093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29211414.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 10000010111093 its reverse (39011101000001), we get a palindrome (49011111111094).
The spelling of 10000010111093 in words is "ten trillion, ten million, one hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •