Base | Representation |
---|---|
bin | 1011100001111110111… |
… | …0011001001000001001 |
3 | 200221022222111211110120 |
4 | 2320133232121020021 |
5 | 11221202243011412 |
6 | 231001202333453 |
7 | 20212056412332 |
oct | 2703756311011 |
9 | 627288454416 |
10 | 198100750857 |
11 | 77017789209 |
12 | 3248765a289 |
13 | 158b09bc309 |
14 | 9833b71289 |
15 | 5246863b8c |
hex | 2e1fb99209 |
198100750857 has 4 divisors (see below), whose sum is σ = 264134334480. Its totient is φ = 132067167236.
The previous prime is 198100750819. The next prime is 198100750919. The reversal of 198100750857 is 758057001891.
198100750857 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 198100750857 - 212 = 198100746761 is a prime.
It is not an unprimeable number, because it can be changed into a prime (198100750157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33016791807 + ... + 33016791812.
It is an arithmetic number, because the mean of its divisors is an integer number (66033583620).
Almost surely, 2198100750857 is an apocalyptic number.
It is an amenable number.
198100750857 is a deficient number, since it is larger than the sum of its proper divisors (66033583623).
198100750857 is an equidigital number, since it uses as much as digits as its factorization.
198100750857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66033583622.
The product of its (nonzero) digits is 705600, while the sum is 51.
The spelling of 198100750857 in words is "one hundred ninety-eight billion, one hundred million, seven hundred fifty thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •