Base | Representation |
---|---|
bin | 1011101110111000110… |
… | …1011111100011101000 |
3 | 201021021102010102211101 |
4 | 2323232031133203220 |
5 | 11300301120311102 |
6 | 232333033411144 |
7 | 20363653213552 |
oct | 2735615374350 |
9 | 637242112741 |
10 | 201565010152 |
11 | 78535214520 |
12 | 33093869ab4 |
13 | 1601362399c |
14 | 9a81ca84d2 |
15 | 539aa60e87 |
hex | 2eee35f8e8 |
201565010152 has 32 divisors (see below), whose sum is σ = 412309296000. Its totient is φ = 91616630400.
The previous prime is 201565010123. The next prime is 201565010177. The reversal of 201565010152 is 251010565102.
It is a self number, because there is not a number n which added to its sum of digits gives 201565010152.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4164652 + ... + 4212772.
It is an arithmetic number, because the mean of its divisors is an integer number (12884665500).
Almost surely, 2201565010152 is an apocalyptic number.
201565010152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
201565010152 is an abundant number, since it is smaller than the sum of its proper divisors (210744285848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201565010152 is a wasteful number, since it uses less digits than its factorization.
201565010152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95737 (or 95733 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 201565010152 its reverse (251010565102), we get a palindrome (452575575254).
The spelling of 201565010152 in words is "two hundred one billion, five hundred sixty-five million, ten thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •