Base | Representation |
---|---|
bin | 1101101111100101000011… |
… | …01010110000000000100001 |
3 | 10222000012112021020012221020 |
4 | 12313302201222300000201 |
5 | 12430124331132424441 |
6 | 144135501520520053 |
7 | 6236321603254521 |
oct | 667624152600041 |
9 | 128005467205836 |
10 | 30222102233121 |
11 | 96a2137905117 |
12 | 34812b4a80029 |
13 | 13b2c16826476 |
14 | 766a86a21681 |
15 | 37622d822e66 |
hex | 1b7ca1ab0021 |
30222102233121 has 32 divisors (see below), whose sum is σ = 40628985384960. Its totient is φ = 19982160234816.
The previous prime is 30222102233051. The next prime is 30222102233171. The reversal of 30222102233121 is 12133220122203.
It is a de Polignac number, because none of the positive numbers 2k-30222102233121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30222102233091 and 30222102233100.
It is not an unprimeable number, because it can be changed into a prime (30222102233171) 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 in 31 ways as a sum of consecutive naturals, for example, 571074700 + ... + 571127618.
It is an arithmetic number, because the mean of its divisors is an integer number (1269655793280).
Almost surely, 230222102233121 is an apocalyptic number.
It is an amenable number.
30222102233121 is a deficient number, since it is larger than the sum of its proper divisors (10406883151839).
30222102233121 is a wasteful number, since it uses less digits than its factorization.
30222102233121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55333.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 30222102233121 its reverse (12133220122203), we get a palindrome (42355322355324).
The spelling of 30222102233121 in words is "thirty trillion, two hundred twenty-two billion, one hundred two million, two hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •