Base | Representation |
---|---|
bin | 110011110000010011111… |
… | …0001110001001010001011 |
3 | 221012000020111001000011012 |
4 | 1213200213301301022023 |
5 | 1413020144044400021 |
6 | 23043421150354135 |
7 | 1332623033412446 |
oct | 147404761611213 |
9 | 27160214030135 |
10 | 7113133200011 |
11 | 22a2732285a53 |
12 | 96a6a5abb94b |
13 | 3c79c4ca5c27 |
14 | 1a83c55b665d |
15 | c50678ec35b |
hex | 67827c7128b |
7113133200011 has 2 divisors, whose sum is σ = 7113133200012. Its totient is φ = 7113133200010.
The previous prime is 7113133199947. The next prime is 7113133200013. The reversal of 7113133200011 is 1100023313117.
It is a strong prime.
It is an emirp because it is prime and its reverse (1100023313117) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7113133200011 - 26 = 7113133199947 is a prime.
It is a Sophie Germain prime.
Together with 7113133200013, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 7113133200011.
It is not a weakly prime, because it can be changed into another prime (7113133200013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3556566600005 + 3556566600006.
It is an arithmetic number, because the mean of its divisors is an integer number (3556566600006).
Almost surely, 27113133200011 is an apocalyptic number.
7113133200011 is a deficient number, since it is larger than the sum of its proper divisors (1).
7113133200011 is an equidigital number, since it uses as much as digits as its factorization.
7113133200011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 23.
Adding to 7113133200011 its reverse (1100023313117), we get a palindrome (8213156513128).
The spelling of 7113133200011 in words is "seven trillion, one hundred thirteen billion, one hundred thirty-three million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •