Base | Representation |
---|---|
bin | 1011101101101001101… |
… | …0111110111011100101 |
3 | 201020102021101200120001 |
4 | 2323122122332323211 |
5 | 11244111122032323 |
6 | 232240053341301 |
7 | 20352512203435 |
oct | 2733232767345 |
9 | 636367350501 |
10 | 201233002213 |
11 | 78384868aa1 |
12 | 33000637831 |
13 | 15c8c8c9c99 |
14 | 9a4db622c5 |
15 | 537b82d3ad |
hex | 2eda6beee5 |
201233002213 has 4 divisors (see below), whose sum is σ = 201388877248. Its totient is φ = 201077127180.
The previous prime is 201233002211. The next prime is 201233002279. The reversal of 201233002213 is 312200332102.
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 201233002213 - 21 = 201233002211 is a prime.
It is a super-3 number, since 3×2012330022133 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201233002211) 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, 77935581 + ... + 77938162.
It is an arithmetic number, because the mean of its divisors is an integer number (50347219312).
Almost surely, 2201233002213 is an apocalyptic number.
It is an amenable number.
201233002213 is a deficient number, since it is larger than the sum of its proper divisors (155875035).
201233002213 is a wasteful number, since it uses less digits than its factorization.
201233002213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155875034.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 201233002213 its reverse (312200332102), we get a palindrome (513433334315).
The spelling of 201233002213 in words is "two hundred one billion, two hundred thirty-three million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •