Base | Representation |
---|---|
bin | 101011111100101101010… |
… | …011101000011011010011 |
3 | 101200201110111121101202001 |
4 | 223330231103220123103 |
5 | 343440202231131011 |
6 | 10231231442334431 |
7 | 431124304353361 |
oct | 53745523503323 |
9 | 11621414541661 |
10 | 3020122130131 |
11 | a64910231997 |
12 | 4093a095a417 |
13 | 18ba475c9192 |
14 | a62634d0631 |
15 | 538610867c1 |
hex | 2bf2d4e86d3 |
3020122130131 has 2 divisors, whose sum is σ = 3020122130132. Its totient is φ = 3020122130130.
The previous prime is 3020122130119. The next prime is 3020122130143. The reversal of 3020122130131 is 1310312210203.
It is a balanced prime because it is at equal distance from previous prime (3020122130119) and next prime (3020122130143).
It is a cyclic number.
It is not a de Polignac number, because 3020122130131 - 219 = 3020121605843 is a prime.
It is a super-2 number, since 2×30201221301312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3020122130099 and 3020122130108.
It is not a weakly prime, because it can be changed into another prime (3020122130111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510061065065 + 1510061065066.
It is an arithmetic number, because the mean of its divisors is an integer number (1510061065066).
Almost surely, 23020122130131 is an apocalyptic number.
3020122130131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020122130131 is an equidigital number, since it uses as much as digits as its factorization.
3020122130131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 3020122130131 its reverse (1310312210203), we get a palindrome (4330434340334).
The spelling of 3020122130131 in words is "three trillion, twenty billion, one hundred twenty-two million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •