Base | Representation |
---|---|
bin | 11011010101010100010000… |
… | …110001010001110001000111 |
3 | 120202122011111101212100222222 |
4 | 123111110100301101301013 |
5 | 111224023410434013111 |
6 | 1103400404102042555 |
7 | 34215016265015453 |
oct | 3325242061216107 |
9 | 522564441770888 |
10 | 120212121001031 |
11 | 35337746421934 |
12 | 11595ab811945b |
13 | 520cc539980b7 |
14 | 2198424c69663 |
15 | dd6ed6c9c7db |
hex | 6d5510c51c47 |
120212121001031 has 2 divisors, whose sum is σ = 120212121001032. Its totient is φ = 120212121001030.
The previous prime is 120212121000989. The next prime is 120212121001033. The reversal of 120212121001031 is 130100121212021.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120212121001031 is a prime.
It is a super-2 number, since 2×1202121210010312 (a number of 29 digits) contains 22 as substring.
Together with 120212121001033, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120212121001033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60106060500515 + 60106060500516.
It is an arithmetic number, because the mean of its divisors is an integer number (60106060500516).
Almost surely, 2120212121001031 is an apocalyptic number.
120212121001031 is a deficient number, since it is larger than the sum of its proper divisors (1).
120212121001031 is an equidigital number, since it uses as much as digits as its factorization.
120212121001031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 120212121001031 its reverse (130100121212021), we get a palindrome (250312242213052).
The spelling of 120212121001031 in words is "one hundred twenty trillion, two hundred twelve billion, one hundred twenty-one million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •