Base | Representation |
---|---|
bin | 1001101001000000000110… |
… | …01100010000000010100101 |
3 | 2210001200221021222011211212 |
4 | 10310200003030100002211 |
5 | 10234320111100204013 |
6 | 113031052350241205 |
7 | 4315436030506634 |
oct | 464400314200245 |
9 | 83050837864755 |
10 | 21200012116133 |
11 | 683396917a164 |
12 | 24648551b6205 |
13 | baa1ca251546 |
14 | 53412c21b51b |
15 | 26b6dab666a8 |
hex | 1348033100a5 |
21200012116133 has 2 divisors, whose sum is σ = 21200012116134. Its totient is φ = 21200012116132.
The previous prime is 21200012116123. The next prime is 21200012116177. The reversal of 21200012116133 is 33161121000212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12414615339844 + 8785396776289 = 3523438^2 + 2964017^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21200012116133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21200012116099 and 21200012116108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21200012116123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600006058066 + 10600006058067.
It is an arithmetic number, because the mean of its divisors is an integer number (10600006058067).
Almost surely, 221200012116133 is an apocalyptic number.
It is an amenable number.
21200012116133 is a deficient number, since it is larger than the sum of its proper divisors (1).
21200012116133 is an equidigital number, since it uses as much as digits as its factorization.
21200012116133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 21200012116133 its reverse (33161121000212), we get a palindrome (54361133116345).
The spelling of 21200012116133 in words is "twenty-one trillion, two hundred billion, twelve million, one hundred sixteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •