Base | Representation |
---|---|
bin | 1011101101101001100… |
… | …0000101110111110101 |
3 | 201020102012222011202222 |
4 | 2323122120011313311 |
5 | 11244110423303323 |
6 | 232240025212125 |
7 | 20352502565510 |
oct | 2733230056765 |
9 | 636365864688 |
10 | 201232244213 |
11 | 783843a0550 |
12 | 33000331045 |
13 | 15c8c6c2c70 |
14 | 9a4da05d77 |
15 | 537b72d9c8 |
hex | 2eda605df5 |
201232244213 has 16 divisors (see below), whose sum is σ = 270185951616. Its totient is φ = 144742472640.
The previous prime is 201232244183. The next prime is 201232244221. The reversal of 201232244213 is 312442232102.
It is a cyclic number.
It is not a de Polignac number, because 201232244213 - 26 = 201232244149 is a prime.
It is a super-2 number, since 2×2012322442132 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (26) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201232244233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100514606 + ... + 100516607.
It is an arithmetic number, because the mean of its divisors is an integer number (16886621976).
Almost surely, 2201232244213 is an apocalyptic number.
It is an amenable number.
201232244213 is a deficient number, since it is larger than the sum of its proper divisors (68953707403).
201232244213 is a wasteful number, since it uses less digits than its factorization.
201232244213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201031244.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 201232244213 its reverse (312442232102), we get a palindrome (513674476315).
The spelling of 201232244213 in words is "two hundred one billion, two hundred thirty-two million, two hundred forty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •