Base | Representation |
---|---|
bin | 10010111111110001… |
… | …11000100100000101 |
3 | 222022202121201101211 |
4 | 21133320320210011 |
5 | 131341330304421 |
6 | 4404001051421 |
7 | 510506236234 |
oct | 113770704405 |
9 | 28282551354 |
10 | 10198681861 |
11 | 43639876a5 |
12 | 1b87626b71 |
13 | c66c027c4 |
14 | 6ca6c0b1b |
15 | 3ea5569e1 |
hex | 25fe38905 |
10198681861 has 2 divisors, whose sum is σ = 10198681862. Its totient is φ = 10198681860.
The previous prime is 10198681811. The next prime is 10198681891. The reversal of 10198681861 is 16818689101.
10198681861 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9716044900 + 482636961 = 98570^2 + 21969^2 .
It is a cyclic number.
It is not a de Polignac number, because 10198681861 - 29 = 10198681349 is a prime.
It is a super-2 number, since 2×101986818612 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10198681811) 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, 5099340930 + 5099340931.
It is an arithmetic number, because the mean of its divisors is an integer number (5099340931).
Almost surely, 210198681861 is an apocalyptic number.
It is an amenable number.
10198681861 is a deficient number, since it is larger than the sum of its proper divisors (1).
10198681861 is an equidigital number, since it uses as much as digits as its factorization.
10198681861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 165888, while the sum is 49.
The spelling of 10198681861 in words is "ten billion, one hundred ninety-eight million, six hundred eighty-one thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •