Base | Representation |
---|---|
bin | 11101100101010111011011… |
… | …010001111110111000000011 |
3 | 122001200111112212221212002102 |
4 | 131211113123101332320003 |
5 | 114023220040021101034 |
6 | 1140420120322141015 |
7 | 36256134632413622 |
oct | 3545273321767003 |
9 | 561614485855072 |
10 | 130111123222019 |
11 | 385038aa0836a5 |
12 | 127144a7ab176b |
13 | 577a5706a38b4 |
14 | 241b5aa6076b9 |
15 | 10097500b297e |
hex | 7655db47ee03 |
130111123222019 has 2 divisors, whose sum is σ = 130111123222020. Its totient is φ = 130111123222018.
The previous prime is 130111123222001. The next prime is 130111123222021. The reversal of 130111123222019 is 910222321111031.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130111123222019 is a prime.
It is a super-2 number, since 2×1301111232220192 (a number of 29 digits) contains 22 as substring.
Together with 130111123222021, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 130111123221982 and 130111123222000.
It is not a weakly prime, because it can be changed into another prime (130111123222049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65055561611009 + 65055561611010.
It is an arithmetic number, because the mean of its divisors is an integer number (65055561611010).
Almost surely, 2130111123222019 is an apocalyptic number.
130111123222019 is a deficient number, since it is larger than the sum of its proper divisors (1).
130111123222019 is an equidigital number, since it uses as much as digits as its factorization.
130111123222019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 29.
The spelling of 130111123222019 in words is "one hundred thirty trillion, one hundred eleven billion, one hundred twenty-three million, two hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •