Base | Representation |
---|---|
bin | 10100011001001000… |
… | …11111101101010001 |
3 | 1001021000011212110221 |
4 | 22030210133231101 |
5 | 134410231440024 |
6 | 5010220153041 |
7 | 535211054434 |
oct | 121444375521 |
9 | 31230155427 |
10 | 10948311889 |
11 | 4709044849 |
12 | 2156698781 |
13 | 10562caa78 |
14 | 75c09781b |
15 | 44127e3e4 |
hex | 28c91fb51 |
10948311889 has 2 divisors, whose sum is σ = 10948311890. Its totient is φ = 10948311888.
The previous prime is 10948311859. The next prime is 10948311893. The reversal of 10948311889 is 98811384901.
10948311889 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., 6212119489 + 4736192400 = 78817^2 + 68820^2 .
It is a cyclic number.
It is not a de Polignac number, because 10948311889 - 221 = 10946214737 is a prime.
It is not a weakly prime, because it can be changed into another prime (10948311859) 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, 5474155944 + 5474155945.
It is an arithmetic number, because the mean of its divisors is an integer number (5474155945).
Almost surely, 210948311889 is an apocalyptic number.
It is an amenable number.
10948311889 is a deficient number, since it is larger than the sum of its proper divisors (1).
10948311889 is an equidigital number, since it uses as much as digits as its factorization.
10948311889 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 497664, while the sum is 52.
The spelling of 10948311889 in words is "ten billion, nine hundred forty-eight million, three hundred eleven thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •