Base | Representation |
---|---|
bin | 110111111011111010… |
… | …1110101100000010011 |
3 | 102111001112010010022022 |
4 | 1233313311311200103 |
5 | 3432002240432011 |
6 | 131103335402055 |
7 | 11451511604561 |
oct | 1576765654023 |
9 | 374045103268 |
10 | 120122202131 |
11 | 46a41940418 |
12 | 1b34482332b |
13 | b434602719 |
14 | 5b57676a31 |
15 | 31d0a938db |
hex | 1bf7d75813 |
120122202131 has 2 divisors, whose sum is σ = 120122202132. Its totient is φ = 120122202130.
The previous prime is 120122202103. The next prime is 120122202133. The reversal of 120122202131 is 131202221021.
It is a strong prime.
It is an emirp because it is prime and its reverse (131202221021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120122202131 - 210 = 120122201107 is a prime.
It is a super-2 number, since 2×1201222021312 (a number of 23 digits) contains 22 as substring.
Together with 120122202133, 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 (120122202133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60061101065 + 60061101066.
It is an arithmetic number, because the mean of its divisors is an integer number (60061101066).
Almost surely, 2120122202131 is an apocalyptic number.
120122202131 is a deficient number, since it is larger than the sum of its proper divisors (1).
120122202131 is an equidigital number, since it uses as much as digits as its factorization.
120122202131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 120122202131 its reverse (131202221021), we get a palindrome (251324423152).
The spelling of 120122202131 in words is "one hundred twenty billion, one hundred twenty-two million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •