Base | Representation |
---|---|
bin | 11011010101001010000001… |
… | …101010110001101001100011 |
3 | 120202121010010102202211222201 |
4 | 123111022001222301221203 |
5 | 111223333403314021011 |
6 | 1103351345323314031 |
7 | 34214150026640452 |
oct | 3325120152615143 |
9 | 522533112684881 |
10 | 120201130220131 |
11 | 35333016410534 |
12 | 1159394b37b917 |
13 | 520bbc194aa4c |
14 | 2197aa12b8b99 |
15 | dd6a91e2ecc1 |
hex | 6d5281ab1a63 |
120201130220131 has 2 divisors, whose sum is σ = 120201130220132. Its totient is φ = 120201130220130.
The previous prime is 120201130220123. The next prime is 120201130220137. The reversal of 120201130220131 is 131022031102021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120201130220131 - 23 = 120201130220123 is a prime.
It is a super-2 number, since 2×1202011302201312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120201130220099 and 120201130220108.
It is not a weakly prime, because it can be changed into another prime (120201130220137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60100565110065 + 60100565110066.
It is an arithmetic number, because the mean of its divisors is an integer number (60100565110066).
Almost surely, 2120201130220131 is an apocalyptic number.
120201130220131 is a deficient number, since it is larger than the sum of its proper divisors (1).
120201130220131 is an equidigital number, since it uses as much as digits as its factorization.
120201130220131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 120201130220131 its reverse (131022031102021), we get a palindrome (251223161322152).
The spelling of 120201130220131 in words is "one hundred twenty trillion, two hundred one billion, one hundred thirty million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •