Base | Representation |
---|---|
bin | 1001100110011000011110… |
… | …11011110101000001000001 |
3 | 2202202002122210222020221002 |
4 | 10303030033123311001001 |
5 | 10231331311420304441 |
6 | 112521451043541345 |
7 | 4306102024452053 |
oct | 463141733650101 |
9 | 82662583866832 |
10 | 21110023213121 |
11 | 67a978a848437 |
12 | 244b32008a855 |
13 | ba188881623b |
14 | 52da329ab8d3 |
15 | 2691c077cb9b |
hex | 13330f6f5041 |
21110023213121 has 2 divisors, whose sum is σ = 21110023213122. Its totient is φ = 21110023213120.
The previous prime is 21110023213117. The next prime is 21110023213159. The reversal of 21110023213121 is 12131232001112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20917460220721 + 192562992400 = 4573561^2 + 438820^2 .
It is a cyclic number.
It is not a de Polignac number, because 21110023213121 - 22 = 21110023213117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21110023213093 and 21110023213102.
It is not a weakly prime, because it can be changed into another prime (21110023218121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10555011606560 + 10555011606561.
It is an arithmetic number, because the mean of its divisors is an integer number (10555011606561).
Almost surely, 221110023213121 is an apocalyptic number.
It is an amenable number.
21110023213121 is a deficient number, since it is larger than the sum of its proper divisors (1).
21110023213121 is an equidigital number, since it uses as much as digits as its factorization.
21110023213121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 21110023213121 its reverse (12131232001112), we get a palindrome (33241255214233).
The spelling of 21110023213121 in words is "twenty-one trillion, one hundred ten billion, twenty-three million, two hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •