Base | Representation |
---|---|
bin | 1010111010100000010001… |
… | …0100001000010111000100 |
3 | 1120111012122100010120111010 |
4 | 2232220010110020113010 |
5 | 3033102413004323022 |
6 | 41304453144442220 |
7 | 2345662262406660 |
oct | 256500424102704 |
9 | 46435570116433 |
10 | 12000211011012 |
11 | 39072962a8574 |
12 | 141987a479370 |
13 | 6907cc330983 |
14 | 2d6b55a298a0 |
15 | 15c24670250c |
hex | aea045085c4 |
12000211011012 has 48 divisors (see below), whose sum is σ = 32000996693120. Its totient is φ = 3428585217792.
The previous prime is 12000211011011. The next prime is 12000211011013. The reversal of 12000211011012 is 21011011200021.
It is an interprime number because it is at equal distance from previous prime (12000211011011) and next prime (12000211011013).
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 (12000211011011) 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, 5518914 + ... + 7379622.
Almost surely, 212000211011012 is an apocalyptic number.
12000211011012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12000211011012 is an abundant number, since it is smaller than the sum of its proper divisors (20000785682108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000211011012 is a wasteful number, since it uses less digits than its factorization.
12000211011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1937500 (or 1937498 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12000211011012 its reverse (21011011200021), we get a palindrome (33011222211033).
The spelling of 12000211011012 in words is "twelve trillion, two hundred eleven million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •