Base | Representation |
---|---|
bin | 110000000100110001101001… |
… | …001000111101000011101011 |
3 | 1000201121221011211212120020112 |
4 | 300010301221020331003223 |
5 | 210203120134441034121 |
6 | 2025403343500444535 |
7 | 62351426611555535 |
oct | 6004615110750353 |
9 | 1021557154776215 |
10 | 211434414002411 |
11 | 61407916690a66 |
12 | 1b8694a554974b |
13 | 90c9244a0c8b2 |
14 | 3a2d6a1ac8855 |
15 | 1969d6351d75b |
hex | c04c6923d0eb |
211434414002411 has 4 divisors (see below), whose sum is σ = 211434857253192. Its totient is φ = 211433970751632.
The previous prime is 211434414002333. The next prime is 211434414002417. The reversal of 211434414002411 is 114200414434112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211434414002411 - 218 = 211434413740267 is a prime.
It is a super-2 number, since 2×2114344140024112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211434414002417) 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, 220909106 + ... + 221864151.
It is an arithmetic number, because the mean of its divisors is an integer number (52858714313298).
Almost surely, 2211434414002411 is an apocalyptic number.
211434414002411 is a deficient number, since it is larger than the sum of its proper divisors (443250781).
211434414002411 is an equidigital number, since it uses as much as digits as its factorization.
211434414002411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443250780.
The product of its (nonzero) digits is 12288, while the sum is 32.
Adding to 211434414002411 its reverse (114200414434112), we get a palindrome (325634828436523).
The spelling of 211434414002411 in words is "two hundred eleven trillion, four hundred thirty-four billion, four hundred fourteen million, two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •