Base | Representation |
---|---|
bin | 1011101100110101000… |
… | …0011000100111001100 |
3 | 201012211212202201010210 |
4 | 2323031100120213030 |
5 | 11243133100320022 |
6 | 232202123202420 |
7 | 20344160554134 |
oct | 2731520304714 |
9 | 635755681123 |
10 | 201012120012 |
11 | 78281112a20 |
12 | 32b5a676410 |
13 | 15c55c10b62 |
14 | 9a2c6a5ac4 |
15 | 536724ba0c |
hex | 2ecd4189cc |
201012120012 has 24 divisors (see below), whose sum is σ = 511667214912. Its totient is φ = 60912763600.
The previous prime is 201012120011. The next prime is 201012120017. The reversal of 201012120012 is 210021210102.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 201012120012.
It is not an unprimeable number, because it can be changed into a prime (201012120011) 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, 761409414 + ... + 761409677.
It is an arithmetic number, because the mean of its divisors is an integer number (21319467288).
Almost surely, 2201012120012 is an apocalyptic number.
201012120012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
201012120012 is an abundant number, since it is smaller than the sum of its proper divisors (310655094900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201012120012 is a wasteful number, since it uses less digits than its factorization.
201012120012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1522819109 (or 1522819107 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201012120012 its reverse (210021210102), we get a palindrome (411033330114).
The spelling of 201012120012 in words is "two hundred one billion, twelve million, one hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •