Base | Representation |
---|---|
bin | 1101110010001010101010… |
… | …00011101000001001110101 |
3 | 10222022201000111011211100012 |
4 | 12321011111003220021311 |
5 | 12433103422333102013 |
6 | 144244404125030005 |
7 | 6245620054224155 |
oct | 671052503501165 |
9 | 128281014154305 |
10 | 30311011222133 |
11 | 97269116a0534 |
12 | 34965883b5305 |
13 | 13bb4155c43c5 |
14 | 76b0bca80765 |
15 | 3786d3ee21a8 |
hex | 1b91550e8275 |
30311011222133 has 2 divisors, whose sum is σ = 30311011222134. Its totient is φ = 30311011222132.
The previous prime is 30311011222097. The next prime is 30311011222157. The reversal of 30311011222133 is 33122211011303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25025026260004 + 5285984962129 = 5002502^2 + 2299127^2 .
It is a cyclic number.
It is not a de Polignac number, because 30311011222133 - 218 = 30311010959989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30311011222099 and 30311011222108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30311011272133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15155505611066 + 15155505611067.
It is an arithmetic number, because the mean of its divisors is an integer number (15155505611067).
Almost surely, 230311011222133 is an apocalyptic number.
It is an amenable number.
30311011222133 is a deficient number, since it is larger than the sum of its proper divisors (1).
30311011222133 is an equidigital number, since it uses as much as digits as its factorization.
30311011222133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 30311011222133 its reverse (33122211011303), we get a palindrome (63433222233436).
The spelling of 30311011222133 in words is "thirty trillion, three hundred eleven billion, eleven million, two hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •