Base | Representation |
---|---|
bin | 1101101001110000100011… |
… | …10111101110111101111011 |
3 | 10221022002100020200021022001 |
4 | 12310320101313232331323 |
5 | 12413340301013101021 |
6 | 143503545545441431 |
7 | 6216012102565642 |
oct | 664702167567573 |
9 | 127262306607261 |
10 | 30022121222011 |
11 | 9625345833616 |
12 | 344a5a37a0277 |
13 | 139a0c6425429 |
14 | 75b115284359 |
15 | 370e26da0091 |
hex | 1b4e11deef7b |
30022121222011 has 16 divisors (see below), whose sum is σ = 30263784675840. Its totient is φ = 29781313542720.
The previous prime is 30022121221909. The next prime is 30022121222017. The reversal of 30022121222011 is 11022212122003.
It is a cyclic number.
It is not a de Polignac number, because 30022121222011 - 221 = 30022119124859 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30022121222011.
It is not an unprimeable number, because it can be changed into a prime (30022121222017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 327738826 + ... + 327830416.
It is an arithmetic number, because the mean of its divisors is an integer number (1891486542240).
Almost surely, 230022121222011 is an apocalyptic number.
30022121222011 is a deficient number, since it is larger than the sum of its proper divisors (241663453829).
30022121222011 is a wasteful number, since it uses less digits than its factorization.
30022121222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96234.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 30022121222011 its reverse (11022212122003), we get a palindrome (41044333344014).
The spelling of 30022121222011 in words is "thirty trillion, twenty-two billion, one hundred twenty-one million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •