Base | Representation |
---|---|
bin | 11110101110011100010… |
… | …111011101111111110101 |
3 | 21110212000202002100120102 |
4 | 132232130113131333311 |
5 | 234043223244341323 |
6 | 4253553211243445 |
7 | 305355520523366 |
oct | 36563427357765 |
9 | 7425022070512 |
10 | 2111452340213 |
11 | 744509889667 |
12 | 2a1269149585 |
13 | 124155907388 |
14 | 742a28cbb6d |
15 | 39dcc858328 |
hex | 1eb9c5ddff5 |
2111452340213 has 2 divisors, whose sum is σ = 2111452340214. Its totient is φ = 2111452340212.
The previous prime is 2111452340201. The next prime is 2111452340269. The reversal of 2111452340213 is 3120432541112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1724079293764 + 387373046449 = 1313042^2 + 622393^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111452340213 - 220 = 2111451291637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111452340273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055726170106 + 1055726170107.
It is an arithmetic number, because the mean of its divisors is an integer number (1055726170107).
Almost surely, 22111452340213 is an apocalyptic number.
It is an amenable number.
2111452340213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111452340213 is an equidigital number, since it uses as much as digits as its factorization.
2111452340213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 2111452340213 its reverse (3120432541112), we get a palindrome (5231884881325).
The spelling of 2111452340213 in words is "two trillion, one hundred eleven billion, four hundred fifty-two million, three hundred forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •