Base | Representation |
---|---|
bin | 10110011000111010… |
… | …00101001101111000 |
3 | 1011000200221212100200 |
4 | 23030131011031320 |
5 | 144104122011300 |
6 | 5304424402200 |
7 | 603604152030 |
oct | 131435051570 |
9 | 34020855320 |
10 | 12020110200 |
11 | 510904777a |
12 | 23b5616360 |
13 | 1197386157 |
14 | 8205748c0 |
15 | 4a53e4200 |
hex | 2cc745378 |
12020110200 has 144 divisors (see below), whose sum is σ = 46134376080. Its totient is φ = 2747450880.
The previous prime is 12020110187. The next prime is 12020110301. The reversal of 12020110200 is 201102021.
12020110200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 464389 + ... + 489588.
Almost surely, 212020110200 is an apocalyptic number.
12020110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12020110200 is an abundant number, since it is smaller than the sum of its proper divisors (34114265880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12020110200 is a wasteful number, since it uses less digits than its factorization.
12020110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 954006 (or 953994 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 12020110200 its reverse (201102021), we get a palindrome (12221212221).
The spelling of 12020110200 in words is "twelve billion, twenty million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •