Base | Representation |
---|---|
bin | 10111110101101… |
… | …00000101000001 |
3 | 111221021101012201 |
4 | 23322310011001 |
5 | 402142421131 |
6 | 31501553201 |
7 | 4645456201 |
oct | 1372640501 |
9 | 457241181 |
10 | 199967041 |
11 | a297021a |
12 | 56b75801 |
13 | 325752c1 |
14 | 1c7b4401 |
15 | 1284e761 |
hex | beb4141 |
199967041 has 2 divisors, whose sum is σ = 199967042. Its totient is φ = 199967040.
The previous prime is 199967029. The next prime is 199967059. The reversal of 199967041 is 140769991.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 127035441 + 72931600 = 11271^2 + 8540^2 .
It is a cyclic number.
It is not a de Polignac number, because 199967041 - 27 = 199966913 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 199966982 and 199967000.
It is not a weakly prime, because it can be changed into another prime (199967011) 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, 99983520 + 99983521.
It is an arithmetic number, because the mean of its divisors is an integer number (99983521).
Almost surely, 2199967041 is an apocalyptic number.
It is an amenable number.
199967041 is a deficient number, since it is larger than the sum of its proper divisors (1).
199967041 is an equidigital number, since it uses as much as digits as its factorization.
199967041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 46.
The square root of 199967041 is about 14140.9702990990. The cubic root of 199967041 is about 584.7714216442.
The spelling of 199967041 in words is "one hundred ninety-nine million, nine hundred sixty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •