Base | Representation |
---|---|
bin | 11011010101010101011000… |
… | …111010001111110101100101 |
3 | 120202122021121202021112111011 |
4 | 123111111120322033311211 |
5 | 111224033400303440343 |
6 | 1103401124135142221 |
7 | 34215061262340004 |
oct | 3325253072176545 |
9 | 522567552245434 |
10 | 120213331311973 |
11 | 35338207630409 |
12 | 11596195514971 |
13 | 52100b765c813 |
14 | 21984db8c0c3b |
15 | dd705817329d |
hex | 6d5558e8fd65 |
120213331311973 has 2 divisors, whose sum is σ = 120213331311974. Its totient is φ = 120213331311972.
The previous prime is 120213331311901. The next prime is 120213331312007. The reversal of 120213331311973 is 379113133312021.
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., 81263337685924 + 38949993626049 = 9014618^2 + 6240993^2 .
It is a cyclic number.
It is not a de Polignac number, because 120213331311973 - 221 = 120213329214821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120213331311373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60106665655986 + 60106665655987.
It is an arithmetic number, because the mean of its divisors is an integer number (60106665655987).
Almost surely, 2120213331311973 is an apocalyptic number.
It is an amenable number.
120213331311973 is a deficient number, since it is larger than the sum of its proper divisors (1).
120213331311973 is an equidigital number, since it uses as much as digits as its factorization.
120213331311973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236, while the sum is 40.
Adding to 120213331311973 its reverse (379113133312021), we get a palindrome (499326464623994).
The spelling of 120213331311973 in words is "one hundred twenty trillion, two hundred thirteen billion, three hundred thirty-one million, three hundred eleven thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •