Base | Representation |
---|---|
bin | 1100011001110111100… |
… | …0011011010010001001 |
3 | 202101001110102000210011 |
4 | 3012131320123102021 |
5 | 11442413131242413 |
6 | 241521531551521 |
7 | 21252604626331 |
oct | 3063570332211 |
9 | 671043360704 |
10 | 213102212233 |
11 | 82415709179 |
12 | 353735bb5a1 |
13 | 1713192a591 |
14 | a4582560c1 |
15 | 582386633d |
hex | 319de1b489 |
213102212233 has 24 divisors (see below), whose sum is σ = 238904452800. Its totient is φ = 189520282368.
The previous prime is 213102212209. The next prime is 213102212261. The reversal of 213102212233 is 332212201312.
213102212233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-213102212233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213102212633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2086116 + ... + 2185882.
It is an arithmetic number, because the mean of its divisors is an integer number (9954352200).
Almost surely, 2213102212233 is an apocalyptic number.
It is an amenable number.
213102212233 is a deficient number, since it is larger than the sum of its proper divisors (25802240567).
213102212233 is a wasteful number, since it uses less digits than its factorization.
213102212233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100209 (or 100192 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 213102212233 its reverse (332212201312), we get a palindrome (545314413545).
The spelling of 213102212233 in words is "two hundred thirteen billion, one hundred two million, two hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •