Base | Representation |
---|---|
bin | 110000011101010101100010… |
… | …111111100010111011011001 |
3 | 1000221121021201212010101002021 |
4 | 300131111202333202323121 |
5 | 210413243313123120441 |
6 | 2033135000251534441 |
7 | 62614400416525315 |
oct | 6035254277427331 |
9 | 1027537655111067 |
10 | 213122233020121 |
11 | 619a86a4500237 |
12 | 1baa062475a421 |
13 | 91bc456954829 |
14 | 3a8b257786b45 |
15 | 1998be976c3d1 |
hex | c1d562fe2ed9 |
213122233020121 has 4 divisors (see below), whose sum is σ = 213122273972992. Its totient is φ = 213122192067252.
The previous prime is 213122233020107. The next prime is 213122233020161. The reversal of 213122233020121 is 121020332221312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 213122233020121 - 215 = 213122232987353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213122233020161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11299305 + ... + 23535478.
It is an arithmetic number, because the mean of its divisors is an integer number (53280568493248).
Almost surely, 2213122233020121 is an apocalyptic number.
It is an amenable number.
213122233020121 is a deficient number, since it is larger than the sum of its proper divisors (40952871).
213122233020121 is an equidigital number, since it uses as much as digits as its factorization.
213122233020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40952870.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 213122233020121 its reverse (121020332221312), we get a palindrome (334142565241433).
The spelling of 213122233020121 in words is "two hundred thirteen trillion, one hundred twenty-two billion, two hundred thirty-three million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •