Base | Representation |
---|---|
bin | 1010111011001000100100… |
… | …1011010011001001001000 |
3 | 1120112020120022222011120101 |
4 | 2232302021023103021020 |
5 | 3033242042140001300 |
6 | 41313442505135144 |
7 | 2346524343324340 |
oct | 256621113231110 |
9 | 46466508864511 |
10 | 12011030000200 |
11 | 3910938343250 |
12 | 141b99978a4b4 |
13 | 6918348bc31a |
14 | 2d74a085bd20 |
15 | 15c67b438b6a |
hex | aec892d3248 |
12011030000200 has 96 divisors (see below), whose sum is σ = 34816388304960. Its totient is φ = 3743697657600.
The previous prime is 12011030000197. The next prime is 12011030000213. The reversal of 12011030000200 is 200003011021.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
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, 389953107 + ... + 389983906.
It is an arithmetic number, because the mean of its divisors is an integer number (362670711510).
Almost surely, 212011030000200 is an apocalyptic number.
12011030000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12011030000200 is an abundant number, since it is smaller than the sum of its proper divisors (22805358304760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011030000200 is a wasteful number, since it uses less digits than its factorization.
12011030000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 779937047 (or 779937038 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 12011030000200 its reverse (200003011021), we get a palindrome (12211033011221).
The spelling of 12011030000200 in words is "twelve trillion, eleven billion, thirty million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •