Base | Representation |
---|---|
bin | 101011001110010101111000… |
… | …010100000010001110010001 |
3 | 220221002112100222202111120221 |
4 | 223032111320110002032101 |
5 | 144404111001344144121 |
6 | 1512151242004233041 |
7 | 55020246010514305 |
oct | 5316257024021621 |
9 | 827075328674527 |
10 | 190101566006161 |
11 | 55632692088aa7 |
12 | 193a2b5999b781 |
13 | 820c668206074 |
14 | 34d2d7191bd05 |
15 | 16e9ea0abcb41 |
hex | ace578502391 |
190101566006161 has 2 divisors, whose sum is σ = 190101566006162. Its totient is φ = 190101566006160.
The previous prime is 190101566006153. The next prime is 190101566006171. The reversal of 190101566006161 is 161600665101091.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 188953065840400 + 1148500165761 = 13746020^2 + 1071681^2 .
It is an emirp because it is prime and its reverse (161600665101091) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 190101566006161 - 23 = 190101566006153 is a prime.
It is a super-2 number, since 2×1901015660061612 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (190101566006171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 95050783003080 + 95050783003081.
It is an arithmetic number, because the mean of its divisors is an integer number (95050783003081).
Almost surely, 2190101566006161 is an apocalyptic number.
It is an amenable number.
190101566006161 is a deficient number, since it is larger than the sum of its proper divisors (1).
190101566006161 is an equidigital number, since it uses as much as digits as its factorization.
190101566006161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 43.
The spelling of 190101566006161 in words is "one hundred ninety trillion, one hundred one billion, five hundred sixty-six million, six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •