Base | Representation |
---|---|
bin | 10111101100101… |
… | …10011000011111 |
3 | 111212001220222121 |
4 | 23312112120133 |
5 | 401342444311 |
6 | 31420523411 |
7 | 4632513412 |
oct | 1366263037 |
9 | 455056877 |
10 | 198796831 |
11 | a2241002 |
12 | 566b0567 |
13 | 3225577c |
14 | 1c58bb79 |
15 | 126bcb71 |
hex | bd9661f |
198796831 has 4 divisors (see below), whose sum is σ = 205209664. Its totient is φ = 192384000.
The previous prime is 198796817. The next prime is 198796847. The reversal of 198796831 is 138697891.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 138697891 = 19 ⋅7299889.
It is a cyclic number.
It is not a de Polignac number, because 198796831 - 29 = 198796319 is a prime.
It is a super-2 number, since 2×1987968312 = 79040360031285122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (198796891) 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 in 3 ways as a sum of consecutive naturals, for example, 3206370 + ... + 3206431.
It is an arithmetic number, because the mean of its divisors is an integer number (51302416).
Almost surely, 2198796831 is an apocalyptic number.
198796831 is a deficient number, since it is larger than the sum of its proper divisors (6412833).
198796831 is an equidigital number, since it uses as much as digits as its factorization.
198796831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6412832.
The product of its digits is 653184, while the sum is 52.
The square root of 198796831 is about 14099.5330064510. The cubic root of 198796831 is about 583.6284923335.
The spelling of 198796831 in words is "one hundred ninety-eight million, seven hundred ninety-six thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •