Base | Representation |
---|---|
bin | 1101111000010100000010… |
… | …01000010001000011101111 |
3 | 11000001220010212201020012222 |
4 | 12330022001020101003233 |
5 | 13000033433213031023 |
6 | 144525412411545555 |
7 | 6300104445420455 |
oct | 674120110210357 |
9 | 130056125636188 |
10 | 30522204033263 |
11 | 97a8437512368 |
12 | 350b4a845b2bb |
13 | 1405301779037 |
14 | 7773d54a29d5 |
15 | 37de44ddecc8 |
hex | 1bc2812110ef |
30522204033263 has 2 divisors, whose sum is σ = 30522204033264. Its totient is φ = 30522204033262.
The previous prime is 30522204033239. The next prime is 30522204033283. The reversal of 30522204033263 is 36233040222503.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30522204033263 - 230 = 30521130291439 is a prime.
It is a super-2 number, since 2×305222040332632 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30522204033283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15261102016631 + 15261102016632.
It is an arithmetic number, because the mean of its divisors is an integer number (15261102016632).
Almost surely, 230522204033263 is an apocalyptic number.
30522204033263 is a deficient number, since it is larger than the sum of its proper divisors (1).
30522204033263 is an equidigital number, since it uses as much as digits as its factorization.
30522204033263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 35.
Adding to 30522204033263 its reverse (36233040222503), we get a palindrome (66755244255766).
The spelling of 30522204033263 in words is "thirty trillion, five hundred twenty-two billion, two hundred four million, thirty-three thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •