Base | Representation |
---|---|
bin | 101101101110101101101011… |
… | …001101101100110001001101 |
3 | 222101010002122011201212020001 |
4 | 231232231223031230301031 |
5 | 202330141312433320044 |
6 | 1551430140014524301 |
7 | 60235413256550644 |
oct | 5556555315546115 |
9 | 871102564655201 |
10 | 201122232323149 |
11 | 590a150699a825 |
12 | 1a682a04806691 |
13 | 882b98c07c947 |
14 | 3794521a6635b |
15 | 183b9b67602d4 |
hex | b6eb6b36cc4d |
201122232323149 has 2 divisors, whose sum is σ = 201122232323150. Its totient is φ = 201122232323148.
The previous prime is 201122232323017. The next prime is 201122232323213. The reversal of 201122232323149 is 941323232221102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 200523102141924 + 599130181225 = 14160618^2 + 774035^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201122232323149 is a prime.
It is a super-2 number, since 2×2011222323231492 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201122232323449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100561116161574 + 100561116161575.
It is an arithmetic number, because the mean of its divisors is an integer number (100561116161575).
Almost surely, 2201122232323149 is an apocalyptic number.
It is an amenable number.
201122232323149 is a deficient number, since it is larger than the sum of its proper divisors (1).
201122232323149 is an equidigital number, since it uses as much as digits as its factorization.
201122232323149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 201122232323149 in words is "two hundred one trillion, one hundred twenty-two billion, two hundred thirty-two million, three hundred twenty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •