Base | Representation |
---|---|
bin | 1001100110101011010001… |
… | …10001011111110010000101 |
3 | 2202210001200220210201221022 |
4 | 10303111220301133302011 |
5 | 10232012442133001013 |
6 | 112530240121400525 |
7 | 4306610030645216 |
oct | 463255061376205 |
9 | 82701626721838 |
10 | 21120112000133 |
11 | 6802a97695443 |
12 | 2451276939145 |
13 | ba2805a1c4b3 |
14 | 53030c84340d |
15 | 2695b1328008 |
hex | 133568c5fc85 |
21120112000133 has 2 divisors, whose sum is σ = 21120112000134. Its totient is φ = 21120112000132.
The previous prime is 21120112000087. The next prime is 21120112000139. The reversal of 21120112000133 is 33100021102112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19853458541284 + 1266653458849 = 4455722^2 + 1125457^2 .
It is a cyclic number.
It is not a de Polignac number, because 21120112000133 - 222 = 21120107805829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21120112000139) 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 as a sum of consecutive naturals, namely, 10560056000066 + 10560056000067.
It is an arithmetic number, because the mean of its divisors is an integer number (10560056000067).
Almost surely, 221120112000133 is an apocalyptic number.
It is an amenable number.
21120112000133 is a deficient number, since it is larger than the sum of its proper divisors (1).
21120112000133 is an equidigital number, since it uses as much as digits as its factorization.
21120112000133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 21120112000133 its reverse (33100021102112), we get a palindrome (54220133102245).
The spelling of 21120112000133 in words is "twenty-one trillion, one hundred twenty billion, one hundred twelve million, one hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •