Base | Representation |
---|---|
bin | 11011010011110111001101… |
… | …100111100001000110000101 |
3 | 120202021121121102220210111022 |
4 | 123103313031213201012011 |
5 | 111220404301242333333 |
6 | 1103242442041120525 |
7 | 34204551352366301 |
oct | 3323671547410605 |
9 | 522247542823438 |
10 | 120112210121093 |
11 | 352a9336326a83 |
12 | 1157a674189145 |
13 | 52036c078cc28 |
14 | 21936679a6d01 |
15 | dd45da7b8c98 |
hex | 6d3dcd9e1185 |
120112210121093 has 2 divisors, whose sum is σ = 120112210121094. Its totient is φ = 120112210121092.
The previous prime is 120112210121041. The next prime is 120112210121119. The reversal of 120112210121093 is 390121012211021.
It is an a-pointer prime, because the next prime (120112210121119) can be obtained adding 120112210121093 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103112611095844 + 16999599025249 = 10154438^2 + 4123057^2 .
It is a cyclic number.
It is not a de Polignac number, because 120112210121093 - 214 = 120112210104709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120112210126093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60056105060546 + 60056105060547.
It is an arithmetic number, because the mean of its divisors is an integer number (60056105060547).
Almost surely, 2120112210121093 is an apocalyptic number.
It is an amenable number.
120112210121093 is a deficient number, since it is larger than the sum of its proper divisors (1).
120112210121093 is an equidigital number, since it uses as much as digits as its factorization.
120112210121093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 120112210121093 in words is "one hundred twenty trillion, one hundred twelve billion, two hundred ten million, one hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •