Base | Representation |
---|---|
bin | 1011101101010011100… |
… | …1000111111101011111 |
3 | 201020011210211220000210 |
4 | 2323110321013331133 |
5 | 11243413400141343 |
6 | 232222541223503 |
7 | 20350304555346 |
oct | 2732471077537 |
9 | 636153756023 |
10 | 201140240223 |
11 | 7833747059a |
12 | 32b95561b93 |
13 | 15c7661bb30 |
14 | 9a416d6b5d |
15 | 5373608333 |
hex | 2ed4e47f5f |
201140240223 has 8 divisors (see below), whose sum is σ = 288816755248. Its totient is φ = 123778609344.
The previous prime is 201140240219. The next prime is 201140240243. The reversal of 201140240223 is 322042041102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201140240223 - 22 = 201140240219 is a prime.
It is a super-2 number, since 2×2011402402232 (a number of 23 digits) contains 22 as substring.
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 201140240223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201140240243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2578720990 + ... + 2578721067.
It is an arithmetic number, because the mean of its divisors is an integer number (36102094406).
Almost surely, 2201140240223 is an apocalyptic number.
201140240223 is a deficient number, since it is larger than the sum of its proper divisors (87676515025).
201140240223 is a wasteful number, since it uses less digits than its factorization.
201140240223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5157442073.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 201140240223 its reverse (322042041102), we get a palindrome (523182281325).
The spelling of 201140240223 in words is "two hundred one billion, one hundred forty million, two hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •