Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …1110001011100000111001 |
3 | 1022110001102112202011022101 |
4 | 2101223210232023200321 |
5 | 2303010223421020323 |
6 | 33143012502423401 |
7 | 2052164444256136 |
oct | 221534456134071 |
9 | 38401375664271 |
10 | 10011111110713 |
11 | 320a763261a49 |
12 | 1158278a31b61 |
13 | 5780750b694b |
14 | 26877ca8358d |
15 | 12562a62ddad |
hex | 91ae4b8b839 |
10011111110713 has 2 divisors, whose sum is σ = 10011111110714. Its totient is φ = 10011111110712.
The previous prime is 10011111110711. The next prime is 10011111110723. The reversal of 10011111110713 is 31701111111001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8222143335184 + 1788967775529 = 2867428^2 + 1337523^2 .
It is an emirp because it is prime and its reverse (31701111111001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10011111110713 - 21 = 10011111110711 is a prime.
Together with 10011111110711, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10011111110711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005555555356 + 5005555555357.
It is an arithmetic number, because the mean of its divisors is an integer number (5005555555357).
Almost surely, 210011111110713 is an apocalyptic number.
It is an amenable number.
10011111110713 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011111110713 is an equidigital number, since it uses as much as digits as its factorization.
10011111110713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 19.
Adding to 10011111110713 its reverse (31701111111001), we get a palindrome (41712222221714).
The spelling of 10011111110713 in words is "ten trillion, eleven billion, one hundred eleven million, one hundred ten thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •