Base | Representation |
---|---|
bin | 1011101100110100111… |
… | …1111110000000001100 |
3 | 201012211212120011122001 |
4 | 2323031033332000030 |
5 | 11243133033323040 |
6 | 232202121002044 |
7 | 20344156621312 |
oct | 2731517760014 |
9 | 635755504561 |
10 | 201012011020 |
11 | 78281049047 |
12 | 32b5a623324 |
13 | 15c55ba3372 |
14 | 9a2c6780b2 |
15 | 536722959a |
hex | 2ecd3fe00c |
201012011020 has 24 divisors (see below), whose sum is σ = 435742167168. Its totient is φ = 77811100800.
The previous prime is 201012011003. The next prime is 201012011029. The reversal of 201012011020 is 20110210102.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 201012010988 and 201012011006.
It is not an unprimeable number, because it can be changed into a prime (201012011029) 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, 162105841 + ... + 162107080.
It is an arithmetic number, because the mean of its divisors is an integer number (18155923632).
Almost surely, 2201012011020 is an apocalyptic number.
201012011020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201012011020 is an abundant number, since it is smaller than the sum of its proper divisors (234730156148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201012011020 is a wasteful number, since it uses less digits than its factorization.
201012011020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324212961 (or 324212959 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201012011020 its reverse (20110210102), we get a palindrome (221122221122).
The spelling of 201012011020 in words is "two hundred one billion, twelve million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •