Base | Representation |
---|---|
bin | 11011010011101110101110… |
… | …110111010001011111101011 |
3 | 120202020202002211120020220012 |
4 | 123103232232313101133223 |
5 | 111220232124140120321 |
6 | 1103234334314122135 |
7 | 34204106612500124 |
oct | 3323565667213753 |
9 | 522222084506805 |
10 | 120103104223211 |
11 | 352a549328613a |
12 | 1157895272034b |
13 | 520289c0b2785 |
14 | 21930424a704b |
15 | dd425617005b |
hex | 6d3baedd17eb |
120103104223211 has 2 divisors, whose sum is σ = 120103104223212. Its totient is φ = 120103104223210.
The previous prime is 120103104223199. The next prime is 120103104223367. The reversal of 120103104223211 is 112322401301021.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120103104223211 is a prime.
It is a super-2 number, since 2×1201031042232112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (120103104225211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60051552111605 + 60051552111606.
It is an arithmetic number, because the mean of its divisors is an integer number (60051552111606).
Almost surely, 2120103104223211 is an apocalyptic number.
120103104223211 is a deficient number, since it is larger than the sum of its proper divisors (1).
120103104223211 is an equidigital number, since it uses as much as digits as its factorization.
120103104223211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 120103104223211 its reverse (112322401301021), we get a palindrome (232425505524232).
The spelling of 120103104223211 in words is "one hundred twenty trillion, one hundred three billion, one hundred four million, two hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •