Base | Representation |
---|---|
bin | 1101101001101111000011… |
… | …01001100110100010110001 |
3 | 10221022000020212101020222202 |
4 | 12310313201221212202301 |
5 | 12413332121411223441 |
6 | 143503333405512545 |
7 | 6215653050242420 |
oct | 664674151464261 |
9 | 127260225336882 |
10 | 30021312211121 |
11 | 9624a700a8780 |
12 | 344a3b8872755 |
13 | 1399cc7938c6a |
14 | 75b079a512b7 |
15 | 370dcad4819b |
hex | 1b4de1a668b1 |
30021312211121 has 16 divisors (see below), whose sum is σ = 37429310435328. Its totient is φ = 23393141566800.
The previous prime is 30021312211109. The next prime is 30021312211123. The reversal of 30021312211121 is 12111221312003.
It is a cyclic number.
It is not a de Polignac number, because 30021312211121 - 242 = 25623265700017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30021312211093 and 30021312211102.
It is not an unprimeable number, because it can be changed into a prime (30021312211123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25873406 + ... + 27008808.
It is an arithmetic number, because the mean of its divisors is an integer number (2339331902208).
Almost surely, 230021312211121 is an apocalyptic number.
It is an amenable number.
30021312211121 is a deficient number, since it is larger than the sum of its proper divisors (7407998224207).
30021312211121 is a wasteful number, since it uses less digits than its factorization.
30021312211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1478812.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 30021312211121 its reverse (12111221312003), we get a palindrome (42132533523124).
The spelling of 30021312211121 in words is "thirty trillion, twenty-one billion, three hundred twelve million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •