Base | Representation |
---|---|
bin | 11000111101101001101110… |
… | …110011001111100000011101 |
3 | 112101201210200211112011222102 |
4 | 120331221232303033200131 |
5 | 103342244014103300343 |
6 | 1025300424353454445 |
7 | 32061023625165515 |
oct | 3075515663174035 |
9 | 471653624464872 |
10 | 109789812946973 |
11 | 31a89664215305 |
12 | 10392002271425 |
13 | 493519a5c1873 |
14 | 1d17bd8d28845 |
15 | ca5d41c823b8 |
hex | 63da6eccf81d |
109789812946973 has 2 divisors, whose sum is σ = 109789812946974. Its totient is φ = 109789812946972.
The previous prime is 109789812946897. The next prime is 109789812947039. The reversal of 109789812946973 is 379649218987901.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79835886918649 + 29953926028324 = 8935093^2 + 5473018^2 .
It is a cyclic number.
It is not a de Polignac number, because 109789812946973 - 232 = 109785517979677 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 109789812946891 and 109789812946900.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109789812946673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54894906473486 + 54894906473487.
It is an arithmetic number, because the mean of its divisors is an integer number (54894906473487).
Almost surely, 2109789812946973 is an apocalyptic number.
It is an amenable number.
109789812946973 is a deficient number, since it is larger than the sum of its proper divisors (1).
109789812946973 is an equidigital number, since it uses as much as digits as its factorization.
109789812946973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2962842624, while the sum is 83.
The spelling of 109789812946973 in words is "one hundred nine trillion, seven hundred eighty-nine billion, eight hundred twelve million, nine hundred forty-six thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •