Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …0100001000010100011101 |
3 | 1022102000000221010012102122 |
4 | 2101201111010020110131 |
5 | 2302320211404323401 |
6 | 33133553152232325 |
7 | 2051325034046651 |
oct | 221412504102435 |
9 | 38360027105378 |
10 | 10000111011101 |
11 | 3206028a66332 |
12 | 1156108b3b6a5 |
13 | 577011155b73 |
14 | 268017b88a61 |
15 | 1251d4a7021b |
hex | 9185510851d |
10000111011101 has 4 divisors (see below), whose sum is σ = 10063805985852. Its totient is φ = 9936416036352.
The previous prime is 10000111011071. The next prime is 10000111011109. The reversal of 10000111011101 is 10111011100001.
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 7676772948601 + 2323338062500 = 2770699^2 + 1524250^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000111011101 - 226 = 10000043902237 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 (10000111011109) 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, 31847487140 + ... + 31847487453.
It is an arithmetic number, because the mean of its divisors is an integer number (2515951496463).
Almost surely, 210000111011101 is an apocalyptic number.
It is an amenable number.
10000111011101 is a deficient number, since it is larger than the sum of its proper divisors (63694974751).
10000111011101 is an equidigital number, since it uses as much as digits as its factorization.
10000111011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63694974750.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10000111011101 its reverse (10111011100001), we get a palindrome (20111122111102).
The spelling of 10000111011101 in words is "ten trillion, one hundred eleven million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •