Base | Representation |
---|---|
bin | 1010001100000111001111… |
… | …1101011101101011011101 |
3 | 1110200000110200022110222022 |
4 | 2203001303331131223131 |
5 | 2432023143332401112 |
6 | 35454404401425525 |
7 | 2234256145322066 |
oct | 243016375355335 |
9 | 43600420273868 |
10 | 11203220200157 |
11 | 362a293810157 |
12 | 130b31393b2a5 |
13 | 6335c79352bb |
14 | 2aa34b1bd56d |
15 | 14664c6bbd72 |
hex | a3073f5dadd |
11203220200157 has 2 divisors, whose sum is σ = 11203220200158. Its totient is φ = 11203220200156.
The previous prime is 11203220200141. The next prime is 11203220200163. The reversal of 11203220200157 is 75100202230211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5741515653316 + 5461704546841 = 2396146^2 + 2337029^2 .
It is a cyclic number.
It is not a de Polignac number, because 11203220200157 - 24 = 11203220200141 is a prime.
It is a super-2 number, since 2×112032202001572 (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 (11203220200357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601610100078 + 5601610100079.
It is an arithmetic number, because the mean of its divisors is an integer number (5601610100079).
Almost surely, 211203220200157 is an apocalyptic number.
It is an amenable number.
11203220200157 is a deficient number, since it is larger than the sum of its proper divisors (1).
11203220200157 is an equidigital number, since it uses as much as digits as its factorization.
11203220200157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1680, while the sum is 26.
Adding to 11203220200157 its reverse (75100202230211), we get a palindrome (86303422430368).
The spelling of 11203220200157 in words is "eleven trillion, two hundred three billion, two hundred twenty million, two hundred thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •