Base | Representation |
---|---|
bin | 1001101001011001000101… |
… | …11111011110011101001111 |
3 | 2210002222120110002202002201 |
4 | 10310230202333132131033 |
5 | 10240030101204240421 |
6 | 113041152045502331 |
7 | 4316422404312355 |
oct | 464544277363517 |
9 | 83088513082081 |
10 | 21213430540111 |
11 | 6839624563757 |
12 | 246737ab719a7 |
13 | bab5582157a4 |
14 | 534a423857d5 |
15 | 26bc23bbab91 |
hex | 134b22fde74f |
21213430540111 has 2 divisors, whose sum is σ = 21213430540112. Its totient is φ = 21213430540110.
The previous prime is 21213430540069. The next prime is 21213430540229. The reversal of 21213430540111 is 11104503431212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21213430540111 - 211 = 21213430538063 is a prime.
It is a super-2 number, since 2×212134305401112 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21213430540111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21213430040111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10606715270055 + 10606715270056.
It is an arithmetic number, because the mean of its divisors is an integer number (10606715270056).
Almost surely, 221213430540111 is an apocalyptic number.
21213430540111 is a deficient number, since it is larger than the sum of its proper divisors (1).
21213430540111 is an equidigital number, since it uses as much as digits as its factorization.
21213430540111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 21213430540111 its reverse (11104503431212), we get a palindrome (32317933971323).
The spelling of 21213430540111 in words is "twenty-one trillion, two hundred thirteen billion, four hundred thirty million, five hundred forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •