Base | Representation |
---|---|
bin | 1010001011111111101110… |
… | …1011011110110000000101 |
3 | 1110122211021001010110122212 |
4 | 2202333323223132300011 |
5 | 2432010030232020122 |
6 | 35453432233233205 |
7 | 2234155142633114 |
oct | 242777353366005 |
9 | 43584231113585 |
10 | 11201202220037 |
11 | 3629448702895 |
12 | 130aa4bb62805 |
13 | 63336583401b |
14 | 2aa1d91a3c7b |
15 | 146580456ce2 |
hex | a2ffbadec05 |
11201202220037 has 2 divisors, whose sum is σ = 11201202220038. Its totient is φ = 11201202220036.
The previous prime is 11201202219947. The next prime is 11201202220067. The reversal of 11201202220037 is 73002220210211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7653682707841 + 3547519512196 = 2766529^2 + 1883486^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201202220037 - 216 = 11201202154501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11201202219994 and 11201202220021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11201202220067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600601110018 + 5600601110019.
It is an arithmetic number, because the mean of its divisors is an integer number (5600601110019).
Almost surely, 211201202220037 is an apocalyptic number.
It is an amenable number.
11201202220037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201202220037 is an equidigital number, since it uses as much as digits as its factorization.
11201202220037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 11201202220037 its reverse (73002220210211), we get a palindrome (84203422430248).
The spelling of 11201202220037 in words is "eleven trillion, two hundred one billion, two hundred two million, two hundred twenty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •