Base | Representation |
---|---|
bin | 11011011111010010011110… |
… | …111001111100011101001101 |
3 | 120212001200100001102200220111 |
4 | 123133102132321330131031 |
5 | 111321240341243002043 |
6 | 1105043300141520021 |
7 | 34315356260432266 |
oct | 3337223671743515 |
9 | 525050301380814 |
10 | 120897405437773 |
11 | 35581335642aa8 |
12 | 11686888573011 |
13 | 525c7654c7c53 |
14 | 21bd673a2b96d |
15 | de9c43ec809d |
hex | 6df49ee7c74d |
120897405437773 has 2 divisors, whose sum is σ = 120897405437774. Its totient is φ = 120897405437772.
The previous prime is 120897405437693. The next prime is 120897405437839. The reversal of 120897405437773 is 377734504798021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67867230756649 + 53030174681124 = 8238157^2 + 7282182^2 .
It is a cyclic number.
It is not a de Polignac number, because 120897405437773 - 29 = 120897405437261 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120897405437699 and 120897405437708.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120897405438773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60448702718886 + 60448702718887.
It is an arithmetic number, because the mean of its divisors is an integer number (60448702718887).
Almost surely, 2120897405437773 is an apocalyptic number.
It is an amenable number.
120897405437773 is a deficient number, since it is larger than the sum of its proper divisors (1).
120897405437773 is an equidigital number, since it uses as much as digits as its factorization.
120897405437773 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 248935680, while the sum is 67.
The spelling of 120897405437773 in words is "one hundred twenty trillion, eight hundred ninety-seven billion, four hundred five million, four hundred thirty-seven thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •