Base | Representation |
---|---|
bin | 1010001011111100000001… |
… | …0111001010010101100101 |
3 | 1110122201200200111222021101 |
4 | 2202333000113022111211 |
5 | 2432001011000202142 |
6 | 35453145403120101 |
7 | 2234121400006141 |
oct | 242770027122545 |
9 | 43581620458241 |
10 | 11200207037797 |
11 | 3628a8797a728 |
12 | 130a812813031 |
13 | 6332375c29ab |
14 | 2aa142d4c221 |
15 | 146522dc80b7 |
hex | a2fc05ca565 |
11200207037797 has 2 divisors, whose sum is σ = 11200207037798. Its totient is φ = 11200207037796.
The previous prime is 11200207037783. The next prime is 11200207037801. The reversal of 11200207037797 is 79773070200211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10433197162116 + 767009875681 = 3230046^2 + 875791^2 .
It is an emirp because it is prime and its reverse (79773070200211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11200207037797 - 211 = 11200207035749 is a prime.
It is a super-2 number, since 2×112002070377972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11200207037737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600103518898 + 5600103518899.
It is an arithmetic number, because the mean of its divisors is an integer number (5600103518899).
Almost surely, 211200207037797 is an apocalyptic number.
It is an amenable number.
11200207037797 is a deficient number, since it is larger than the sum of its proper divisors (1).
11200207037797 is an equidigital number, since it uses as much as digits as its factorization.
11200207037797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259308, while the sum is 46.
The spelling of 11200207037797 in words is "eleven trillion, two hundred billion, two hundred seven million, thirty-seven thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •