Base | Representation |
---|---|
bin | 1100010011101001001… |
… | …0111010001110101101 |
3 | 202012202000112122201202 |
4 | 3010322102322032231 |
5 | 11431002421330013 |
6 | 241044045215245 |
7 | 21163316346254 |
oct | 3047222721655 |
9 | 665660478652 |
10 | 211431433133 |
11 | 817385940a8 |
12 | 34b87b61525 |
13 | 16c267424ab |
14 | a33a3b979b |
15 | 5776d35858 |
hex | 313a4ba3ad |
211431433133 has 4 divisors (see below), whose sum is σ = 212952522720. Its totient is φ = 209910343548.
The previous prime is 211431433121. The next prime is 211431433151. The reversal of 211431433133 is 331334134112.
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 211431433133 - 230 = 210357691309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211431433096 and 211431433105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211431433153) 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, 760544585 + ... + 760544862.
It is an arithmetic number, because the mean of its divisors is an integer number (53238130680).
Almost surely, 2211431433133 is an apocalyptic number.
It is an amenable number.
211431433133 is a deficient number, since it is larger than the sum of its proper divisors (1521089587).
211431433133 is a wasteful number, since it uses less digits than its factorization.
211431433133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1521089586.
The product of its digits is 7776, while the sum is 29.
Adding to 211431433133 its reverse (331334134112), we get a palindrome (542765567245).
The spelling of 211431433133 in words is "two hundred eleven billion, four hundred thirty-one million, four hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •