Base | Representation |
---|---|
bin | 1011101101001111100… |
… | …0010001100100100000 |
3 | 201020010121212012102012 |
4 | 2323103320101210200 |
5 | 11243400022141344 |
6 | 232221133012052 |
7 | 20350010222564 |
oct | 2732370214440 |
9 | 636117765365 |
10 | 201123240224 |
11 | 7832890a205 |
12 | 32b8b924028 |
13 | 15c72c4906a |
14 | 9a3d34d6a4 |
15 | 5371d9b29e |
hex | 2ed3e11920 |
201123240224 has 24 divisors (see below), whose sum is σ = 416801453040. Its totient is φ = 95268902976.
The previous prime is 201123240191. The next prime is 201123240233. The reversal of 201123240224 is 422042321102.
201123240224 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 201123240224.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 165396794 + ... + 165398009.
It is an arithmetic number, because the mean of its divisors is an integer number (17366727210).
Almost surely, 2201123240224 is an apocalyptic number.
It is an amenable number.
201123240224 is an abundant number, since it is smaller than the sum of its proper divisors (215678212816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201123240224 is a wasteful number, since it uses less digits than its factorization.
201123240224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330794832 (or 330794824 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 201123240224 its reverse (422042321102), we get a palindrome (623165561326).
The spelling of 201123240224 in words is "two hundred one billion, one hundred twenty-three million, two hundred forty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •