Base | Representation |
---|---|
bin | 1011101101100010000… |
… | …1010100111111100100 |
3 | 201020100001101110001110 |
4 | 2323120201110333210 |
5 | 11244024441023022 |
6 | 232232554025020 |
7 | 20351644140246 |
oct | 2733041247744 |
9 | 636301343043 |
10 | 201201111012 |
11 | 78368866730 |
12 | 32bb1a18170 |
13 | 15c86112255 |
14 | 9a49820096 |
15 | 5378b2e00c |
hex | 2ed8854fe4 |
201201111012 has 48 divisors (see below), whose sum is σ = 512174702592. Its totient is φ = 60966888480.
The previous prime is 201201110969. The next prime is 201201111017. The reversal of 201201111012 is 210111102102.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (201201111017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4556713 + ... + 4600655.
It is an arithmetic number, because the mean of its divisors is an integer number (10670306304).
Almost surely, 2201201111012 is an apocalyptic number.
201201111012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
201201111012 is an abundant number, since it is smaller than the sum of its proper divisors (310973591580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201201111012 is a wasteful number, since it uses less digits than its factorization.
201201111012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78648 (or 78646 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201201111012 its reverse (210111102102), we get a palindrome (411312213114).
It can be divided in two parts, 201201 and 111012, that added together give a palindrome (312213).
The spelling of 201201111012 in words is "two hundred one billion, two hundred one million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.882 sec. • engine limits •