Base | Representation |
---|---|
bin | 11011010101010011011011… |
… | …000100010001011111111111 |
3 | 120202122002011121111100001002 |
4 | 123111103123010101133333 |
5 | 111224020034310323012 |
6 | 1103400134434440515 |
7 | 34214655044514416 |
oct | 3325233304213777 |
9 | 522562147440032 |
10 | 120211220011007 |
11 | 35337323883784 |
12 | 115958a643313b |
13 | 520cb3c115bc8 |
14 | 219837b33247d |
15 | dd6e82b277c2 |
hex | 6d54db1117ff |
120211220011007 has 2 divisors, whose sum is σ = 120211220011008. Its totient is φ = 120211220011006.
The previous prime is 120211220010953. The next prime is 120211220011033. The reversal of 120211220011007 is 700110022112021.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (700110022112021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120211220011007 - 28 = 120211220010751 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120211220011007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120211220014007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60105610005503 + 60105610005504.
It is an arithmetic number, because the mean of its divisors is an integer number (60105610005504).
Almost surely, 2120211220011007 is an apocalyptic number.
120211220011007 is a deficient number, since it is larger than the sum of its proper divisors (1).
120211220011007 is an equidigital number, since it uses as much as digits as its factorization.
120211220011007 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 120211220011007 its reverse (700110022112021), we get a palindrome (820321242123028).
The spelling of 120211220011007 in words is "one hundred twenty trillion, two hundred eleven billion, two hundred twenty million, eleven thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •