Base | Representation |
---|---|
bin | 1011101101001101101… |
… | …0110010100000011100 |
3 | 201020010002022111122200 |
4 | 2323103122302200130 |
5 | 11243341032321222 |
6 | 232220255211500 |
7 | 20346554431056 |
oct | 2732332624034 |
9 | 636102274580 |
10 | 201115510812 |
11 | 7832450aa67 |
12 | 32b89216b90 |
13 | 15c71470b48 |
14 | 9a3c2da8d6 |
15 | 5371370eac |
hex | 2ed36b281c |
201115510812 has 72 divisors (see below), whose sum is σ = 530607351456. Its totient is φ = 64108222464.
The previous prime is 201115510763. The next prime is 201115510819. The reversal of 201115510812 is 218015511102.
201115510812 is a `hidden beast` number, since 20 + 1 + 11 + 551 + 0 + 81 + 2 = 666.
201115510812 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201115510819) 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 23 ways as a sum of consecutive naturals, for example, 3663148 + ... + 3717644.
It is an arithmetic number, because the mean of its divisors is an integer number (7369546548).
Almost surely, 2201115510812 is an apocalyptic number.
It is an amenable number.
201115510812 is an abundant number, since it is smaller than the sum of its proper divisors (329491840644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201115510812 is a wasteful number, since it uses less digits than its factorization.
201115510812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58987 (or 58982 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 27.
The spelling of 201115510812 in words is "two hundred one billion, one hundred fifteen million, five hundred ten thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •