Base | Representation |
---|---|
bin | 1010000000110111011101… |
… | …1111000010101010001011 |
3 | 1102222112202020100021100222 |
4 | 2200031313133002222023 |
5 | 2420341442441240312 |
6 | 35225532110420255 |
7 | 2214306131135456 |
oct | 240156737025213 |
9 | 42875666307328 |
10 | 11010005805707 |
11 | 3565354279927 |
12 | 129999080168b |
13 | 61b315394c4c |
14 | 2a0c5c3aa49d |
15 | 1415ded12672 |
hex | a03777c2a8b |
11010005805707 has 2 divisors, whose sum is σ = 11010005805708. Its totient is φ = 11010005805706.
The previous prime is 11010005805677. The next prime is 11010005805709. The reversal of 11010005805707 is 70750850001011.
11010005805707 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (70750850001011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11010005805707 - 210 = 11010005804683 is a prime.
Together with 11010005805709, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11010005805709) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505002902853 + 5505002902854.
It is an arithmetic number, because the mean of its divisors is an integer number (5505002902854).
Almost surely, 211010005805707 is an apocalyptic number.
11010005805707 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010005805707 is an equidigital number, since it uses as much as digits as its factorization.
11010005805707 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9800, while the sum is 35.
Adding to 11010005805707 its reverse (70750850001011), we get a palindrome (81760855806718).
The spelling of 11010005805707 in words is "eleven trillion, ten billion, five million, eight hundred five thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •