Base | Representation |
---|---|
bin | 11100110001000111110… |
… | …00010100100010111101 |
3 | 10111111100101121101212101 |
4 | 32120203320110202331 |
5 | 112143313234213421 |
6 | 2034030214505101 |
7 | 131261401103626 |
oct | 16304370244275 |
9 | 3444311541771 |
10 | 988444444861 |
11 | 351219136325 |
12 | 13b698065191 |
13 | 72296237353 |
14 | 35bab87ca4d |
15 | 1aaa2038191 |
hex | e623e148bd |
988444444861 has 2 divisors, whose sum is σ = 988444444862. Its totient is φ = 988444444860.
The previous prime is 988444444817. The next prime is 988444444891. The reversal of 988444444861 is 168444444889.
988444444861 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., 869052772900 + 119391671961 = 932230^2 + 345531^2 .
It is a cyclic number.
It is not a de Polignac number, because 988444444861 - 213 = 988444436669 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 988444444793 and 988444444802.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (988444444811) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 494222222430 + 494222222431.
It is an arithmetic number, because the mean of its divisors is an integer number (494222222431).
Almost surely, 2988444444861 is an apocalyptic number.
It is an amenable number.
988444444861 is a deficient number, since it is larger than the sum of its proper divisors (1).
988444444861 is an equidigital number, since it uses as much as digits as its factorization.
988444444861 is an evil number, because the sum of its binary digits is even.
The product of its digits is 113246208, while the sum is 64.
The spelling of 988444444861 in words is "nine hundred eighty-eight billion, four hundred forty-four million, four hundred forty-four thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •