Base | Representation |
---|---|
bin | 1100010010100001110… |
… | …1000010111010001001 |
3 | 202011222011021222012001 |
4 | 3010220131002322021 |
5 | 11424344304201413 |
6 | 240554233351001 |
7 | 21153023145505 |
oct | 3045035027211 |
9 | 664864258161 |
10 | 211132100233 |
11 | 815a462593a |
12 | 34b03868461 |
13 | 16ba9719232 |
14 | a30c73b305 |
15 | 575a9094dd |
hex | 3128742e89 |
211132100233 has 4 divisors (see below), whose sum is σ = 211137354000. Its totient is φ = 211126846468.
The previous prime is 211132100227. The next prime is 211132100237. The reversal of 211132100233 is 332001231112.
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 211132100233 - 229 = 210595229321 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 211132100233.
It is not an unprimeable number, because it can be changed into a prime (211132100237) 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, 2566135 + ... + 2647132.
It is an arithmetic number, because the mean of its divisors is an integer number (52784338500).
Almost surely, 2211132100233 is an apocalyptic number.
It is an amenable number.
211132100233 is a deficient number, since it is larger than the sum of its proper divisors (5253767).
211132100233 is an equidigital number, since it uses as much as digits as its factorization.
211132100233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5253766.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 211132100233 its reverse (332001231112), we get a palindrome (543133331345).
The spelling of 211132100233 in words is "two hundred eleven billion, one hundred thirty-two million, one hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •