Base | Representation |
---|---|
bin | 110001010110110000… |
… | …1110001110000101111 |
3 | 101010120122212200211212 |
4 | 1202231201301300233 |
5 | 3214032033344142 |
6 | 120405200505035 |
7 | 10441354423565 |
oct | 1425541616057 |
9 | 333518780755 |
10 | 105990528047 |
11 | 40a4a987528 |
12 | 1866001b17b |
13 | 9cc19400b1 |
14 | 51b68c5a35 |
15 | 2b55100d82 |
hex | 18ad871c2f |
105990528047 has 2 divisors, whose sum is σ = 105990528048. Its totient is φ = 105990528046.
The previous prime is 105990527977. The next prime is 105990528103. The reversal of 105990528047 is 740825099501.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105990528047 is a prime.
It is a super-2 number, since 2×1059905280472 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105990527986 and 105990528004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105990521047) 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 as a sum of consecutive naturals, namely, 52995264023 + 52995264024.
It is an arithmetic number, because the mean of its divisors is an integer number (52995264024).
Almost surely, 2105990528047 is an apocalyptic number.
105990528047 is a deficient number, since it is larger than the sum of its proper divisors (1).
105990528047 is an equidigital number, since it uses as much as digits as its factorization.
105990528047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 907200, while the sum is 50.
The spelling of 105990528047 in words is "one hundred five billion, nine hundred ninety million, five hundred twenty-eight thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •