Base | Representation |
---|---|
bin | 1101101001110000111001… |
… | …00101111111011010000011 |
3 | 10221022002210210012001010101 |
4 | 12310320130211333122003 |
5 | 12413341133041321011 |
6 | 143504015453343231 |
7 | 6216016415651155 |
oct | 664703445773203 |
9 | 127262723161111 |
10 | 30022301120131 |
11 | 9625428336751 |
12 | 344a633a97b17 |
13 | 139a124791b18 |
14 | 75b131112ad5 |
15 | 370e37a882c1 |
hex | 1b4e1c97f683 |
30022301120131 has 2 divisors, whose sum is σ = 30022301120132. Its totient is φ = 30022301120130.
The previous prime is 30022301120111. The next prime is 30022301120159. The reversal of 30022301120131 is 13102110322003.
It is a weak prime.
It is an emirp because it is prime and its reverse (13102110322003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30022301120131 - 27 = 30022301120003 is a prime.
It is a super-2 number, since 2×300223011201312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30022301120099 and 30022301120108.
It is not a weakly prime, because it can be changed into another prime (30022301120101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15011150560065 + 15011150560066.
It is an arithmetic number, because the mean of its divisors is an integer number (15011150560066).
Almost surely, 230022301120131 is an apocalyptic number.
30022301120131 is a deficient number, since it is larger than the sum of its proper divisors (1).
30022301120131 is an equidigital number, since it uses as much as digits as its factorization.
30022301120131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 30022301120131 its reverse (13102110322003), we get a palindrome (43124411442134).
The spelling of 30022301120131 in words is "thirty trillion, twenty-two billion, three hundred one million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •