Base | Representation |
---|---|
bin | 1010000000111110111110… |
… | …1111010000011001010101 |
3 | 1102222201221211122201200221 |
4 | 2200033233233100121111 |
5 | 2420410110432302242 |
6 | 35230504221034341 |
7 | 2214410126553652 |
oct | 240175757203125 |
9 | 42881854581627 |
10 | 11012023322197 |
11 | 356619a09a927 |
12 | 129a2543b59b1 |
13 | 61b5773631a1 |
14 | 2a0db0304c29 |
15 | 1416abed5167 |
hex | a03efbd0655 |
11012023322197 has 2 divisors, whose sum is σ = 11012023322198. Its totient is φ = 11012023322196.
The previous prime is 11012023322171. The next prime is 11012023322213. The reversal of 11012023322197 is 79122332021011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10969072417681 + 42950904516 = 3311959^2 + 207246^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012023322197 - 211 = 11012023320149 is a prime.
It is a super-2 number, since 2×110120233221972 (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 (11012023322137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506011661098 + 5506011661099.
It is an arithmetic number, because the mean of its divisors is an integer number (5506011661099).
Almost surely, 211012023322197 is an apocalyptic number.
It is an amenable number.
11012023322197 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012023322197 is an equidigital number, since it uses as much as digits as its factorization.
11012023322197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 34.
The spelling of 11012023322197 in words is "eleven trillion, twelve billion, twenty-three million, three hundred twenty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.965 sec. • engine limits •