Base | Representation |
---|---|
bin | 1011101101001101111… |
… | …0001010101101000000 |
3 | 201020010010222111101110 |
4 | 2323103132022231000 |
5 | 11243341244140402 |
6 | 232220330203320 |
7 | 20346565106604 |
oct | 2732336125500 |
9 | 636103874343 |
10 | 201116396352 |
11 | 78324a65313 |
12 | 32b89583540 |
13 | 15c716c0c31 |
14 | 9a3c48b504 |
15 | 537149856c |
hex | 2ed378ab40 |
201116396352 has 56 divisors (see below), whose sum is σ = 563421678336. Its totient is φ = 63095339008.
The previous prime is 201116396333. The next prime is 201116396357. The reversal of 201116396352 is 253693611102.
201116396352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2011163963522 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201116396352.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201116396357) 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 7 ways as a sum of consecutive naturals, for example, 30805008 + ... + 30811535.
Almost surely, 2201116396352 is an apocalyptic number.
It is an amenable number.
201116396352 is an abundant number, since it is smaller than the sum of its proper divisors (362305281984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201116396352 is a wasteful number, since it uses less digits than its factorization.
201116396352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61616575 (or 61616565 counting only the distinct ones).
The product of its (nonzero) digits is 58320, while the sum is 39.
The spelling of 201116396352 in words is "two hundred one billion, one hundred sixteen million, three hundred ninety-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •