Base | Representation |
---|---|
bin | 1011010110000011110… |
… | …1000000000000110001 |
3 | 200122001220222112122022 |
4 | 2311200331000000301 |
5 | 11143123413210024 |
6 | 225311430121225 |
7 | 20036543533601 |
oct | 2654075000061 |
9 | 618056875568 |
10 | 194900131889 |
11 | 75725052871 |
12 | 319337b0215 |
13 | 154c0894b38 |
14 | 960ca64c01 |
15 | 510a89235e |
hex | 2d60f40031 |
194900131889 has 2 divisors, whose sum is σ = 194900131890. Its totient is φ = 194900131888.
The previous prime is 194900131859. The next prime is 194900131913. The reversal of 194900131889 is 988131009491.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 178238485489 + 16661646400 = 422183^2 + 129080^2 .
It is an emirp because it is prime and its reverse (988131009491) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-194900131889 is a prime.
It is a super-2 number, since 2×1949001318892 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 194900131889.
It is not a weakly prime, because it can be changed into another prime (194900131819) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 97450065944 + 97450065945.
It is an arithmetic number, because the mean of its divisors is an integer number (97450065945).
Almost surely, 2194900131889 is an apocalyptic number.
It is an amenable number.
194900131889 is a deficient number, since it is larger than the sum of its proper divisors (1).
194900131889 is an equidigital number, since it uses as much as digits as its factorization.
194900131889 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 559872, while the sum is 53.
The spelling of 194900131889 in words is "one hundred ninety-four billion, nine hundred million, one hundred thirty-one thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •