Base | Representation |
---|---|
bin | 10110101110100… |
… | …00000101001101 |
3 | 111021201202011112 |
4 | 23113100011031 |
5 | 342301111212 |
6 | 30530101405 |
7 | 4503311015 |
oct | 1327200515 |
9 | 437652145 |
10 | 190644557 |
11 | 98683094 |
12 | 53a1a865 |
13 | 3065cc3c |
14 | 1b468c45 |
15 | 11b0c422 |
hex | b5d014d |
190644557 has 2 divisors, whose sum is σ = 190644558. Its totient is φ = 190644556.
The previous prime is 190644523. The next prime is 190644563. The reversal of 190644557 is 755446091.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 153908836 + 36735721 = 12406^2 + 6061^2 .
It is an emirp because it is prime and its reverse (755446091) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 190644557 - 220 = 189595981 is a prime.
It is a super-2 number, since 2×1906445572 = 72690694227452498, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (190644577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 95322278 + 95322279.
It is an arithmetic number, because the mean of its divisors is an integer number (95322279).
Almost surely, 2190644557 is an apocalyptic number.
It is an amenable number.
190644557 is a deficient number, since it is larger than the sum of its proper divisors (1).
190644557 is an equidigital number, since it uses as much as digits as its factorization.
190644557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 41.
The square root of 190644557 is about 13807.4094963538. The cubic root of 190644557 is about 575.5390604484.
The spelling of 190644557 in words is "one hundred ninety million, six hundred forty-four thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •