Base | Representation |
---|---|
bin | 11000000110000111100000… |
… | …001010110110110111110011 |
3 | 111220012222002122210121111112 |
4 | 120012013200022312313303 |
5 | 102342232201143134122 |
6 | 1013215314311503535 |
7 | 31215221564163461 |
oct | 3006074012666763 |
9 | 456188078717445 |
10 | 105973489036787 |
11 | 30848116924579 |
12 | ba76457087bab |
13 | 4719345c0c158 |
14 | 1c25203add831 |
15 | c3b9310c22e2 |
hex | 6061e02b6df3 |
105973489036787 has 2 divisors, whose sum is σ = 105973489036788. Its totient is φ = 105973489036786.
The previous prime is 105973489036747. The next prime is 105973489036813. The reversal of 105973489036787 is 787630984379501.
It is a strong prime.
It is an emirp because it is prime and its reverse (787630984379501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105973489036787 is a prime.
It is a super-2 number, since 2×1059734890367872 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105973489036747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52986744518393 + 52986744518394.
It is an arithmetic number, because the mean of its divisors is an integer number (52986744518394).
Almost surely, 2105973489036787 is an apocalyptic number.
105973489036787 is a deficient number, since it is larger than the sum of its proper divisors (1).
105973489036787 is an equidigital number, since it uses as much as digits as its factorization.
105973489036787 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920360960, while the sum is 77.
The spelling of 105973489036787 in words is "one hundred five trillion, nine hundred seventy-three billion, four hundred eighty-nine million, thirty-six thousand, seven hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •