Base | Representation |
---|---|
bin | 10111101011100… |
… | …00110101010111 |
3 | 111211210010000022 |
4 | 23311300311113 |
5 | 401323034111 |
6 | 31413335355 |
7 | 4631303126 |
oct | 1365606527 |
9 | 454703008 |
10 | 198643031 |
11 | a21464a4 |
12 | 5663755b |
13 | 32200772 |
14 | 1c54babd |
15 | 1268c2db |
hex | bd70d57 |
198643031 has 2 divisors, whose sum is σ = 198643032. Its totient is φ = 198643030.
The previous prime is 198642979. The next prime is 198643057. The reversal of 198643031 is 130346891.
It is a strong prime.
It is an emirp because it is prime and its reverse (130346891) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 198643031 - 214 = 198626647 is a prime.
It is a super-3 number, since 3×1986430313 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 198642982 and 198643000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (198643061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99321515 + 99321516.
It is an arithmetic number, because the mean of its divisors is an integer number (99321516).
Almost surely, 2198643031 is an apocalyptic number.
198643031 is a deficient number, since it is larger than the sum of its proper divisors (1).
198643031 is an equidigital number, since it uses as much as digits as its factorization.
198643031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 35.
The square root of 198643031 is about 14094.0778698005. The cubic root of 198643031 is about 583.4779446279.
The spelling of 198643031 in words is "one hundred ninety-eight million, six hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •