Base | Representation |
---|---|
bin | 11011010011101011110110… |
… | …011111100100111110100001 |
3 | 120202020110010021010102120122 |
4 | 123103223312133210332201 |
5 | 111220204310304110214 |
6 | 1103233103335450025 |
7 | 34203640142532554 |
oct | 3323536637447641 |
9 | 522213107112518 |
10 | 120100011003809 |
11 | 352a4146235671 |
12 | 1157822a826915 |
13 | 52024c82bcb35 |
14 | 2192c2b75669b |
15 | dd412481588e |
hex | 6d3af67e4fa1 |
120100011003809 has 2 divisors, whose sum is σ = 120100011003810. Its totient is φ = 120100011003808.
The previous prime is 120100011003799. The next prime is 120100011003811. The reversal of 120100011003809 is 908300110001021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117808708176784 + 2291302827025 = 10853972^2 + 1513705^2 .
It is a cyclic number.
It is not a de Polignac number, because 120100011003809 - 212 = 120100010999713 is a prime.
Together with 120100011003811, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (120100011003109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60050005501904 + 60050005501905.
It is an arithmetic number, because the mean of its divisors is an integer number (60050005501905).
Almost surely, 2120100011003809 is an apocalyptic number.
It is an amenable number.
120100011003809 is a deficient number, since it is larger than the sum of its proper divisors (1).
120100011003809 is an equidigital number, since it uses as much as digits as its factorization.
120100011003809 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 120100011003809 in words is "one hundred twenty trillion, one hundred billion, eleven million, three thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •