Base | Representation |
---|---|
bin | 11011010101010011011111… |
… | …110110010010111101101111 |
3 | 120202122002101012110001000122 |
4 | 123111103133312102331233 |
5 | 111224020220324424241 |
6 | 1103400150422115155 |
7 | 34214660040424115 |
oct | 3325233766227557 |
9 | 522562335401018 |
10 | 120211300233071 |
11 | 35337365096803 |
12 | 1159590927babb |
13 | 520cb52923398 |
14 | 2198387c55ab5 |
15 | dd6e89bc204b |
hex | 6d54dfd92f6f |
120211300233071 has 2 divisors, whose sum is σ = 120211300233072. Its totient is φ = 120211300233070.
The previous prime is 120211300232983. The next prime is 120211300233103. The reversal of 120211300233071 is 170332003112021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120211300233071 - 214 = 120211300216687 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120211300233071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120211300232071) 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, 60105650116535 + 60105650116536.
It is an arithmetic number, because the mean of its divisors is an integer number (60105650116536).
Almost surely, 2120211300233071 is an apocalyptic number.
120211300233071 is a deficient number, since it is larger than the sum of its proper divisors (1).
120211300233071 is an equidigital number, since it uses as much as digits as its factorization.
120211300233071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 120211300233071 its reverse (170332003112021), we get a palindrome (290543303345092).
The spelling of 120211300233071 in words is "one hundred twenty trillion, two hundred eleven billion, three hundred million, two hundred thirty-three thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •