Base | Representation |
---|---|
bin | 110000011101010100101100… |
… | …110001010010000000000111 |
3 | 1000221121012101110100100220222 |
4 | 300131110230301102000013 |
5 | 210413234432231423421 |
6 | 2033134330113414555 |
7 | 62614336032241415 |
oct | 6035245461220007 |
9 | 1027535343310828 |
10 | 213121323311111 |
11 | 619a8277a47406 |
12 | 1baa040bb6a45b |
13 | 91bc34033bb87 |
14 | 3a8b1aca202b5 |
15 | 1998b94973cab |
hex | c1d52cc52007 |
213121323311111 has 16 divisors (see below), whose sum is σ = 222250108093440. Its totient is φ = 204111828668160.
The previous prime is 213121323311069. The next prime is 213121323311131. The reversal of 213121323311111 is 111113323121312.
It is a cyclic number.
It is not a de Polignac number, because 213121323311111 - 222 = 213121319116807 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213121323311131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12999731 + ... + 24397451.
It is an arithmetic number, because the mean of its divisors is an integer number (13890631755840).
Almost surely, 2213121323311111 is an apocalyptic number.
213121323311111 is a deficient number, since it is larger than the sum of its proper divisors (9128784782329).
213121323311111 is a wasteful number, since it uses less digits than its factorization.
213121323311111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11402954.
The product of its digits is 648, while the sum is 26.
Adding to 213121323311111 its reverse (111113323121312), we get a palindrome (324234646432423).
The spelling of 213121323311111 in words is "two hundred thirteen trillion, one hundred twenty-one billion, three hundred twenty-three million, three hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •