Base | Representation |
---|---|
bin | 1010111010100000001111… |
… | …0010100110010111010100 |
3 | 1120111012121201120222212120 |
4 | 2232220003302212113110 |
5 | 3033102403232033022 |
6 | 41304452232215540 |
7 | 2345662124610105 |
oct | 256500362462724 |
9 | 46435551528776 |
10 | 12000202221012 |
11 | 3907291344505 |
12 | 141987753a5b0 |
13 | 6907ca573aa5 |
14 | 2d6b547bc3ac |
15 | 15c245a67d5c |
hex | aea03ca65d4 |
12000202221012 has 96 divisors (see below), whose sum is σ = 29373706113024. Its totient is φ = 3808239494400.
The previous prime is 12000202220971. The next prime is 12000202221013. The reversal of 12000202221012 is 21012220200021.
It is a junction number, because it is equal to n+sod(n) for n = 12000202220982 and 12000202221000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12000202221013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18650823 + ... + 19283505.
It is an arithmetic number, because the mean of its divisors is an integer number (305976105344).
Almost surely, 212000202221012 is an apocalyptic number.
12000202221012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12000202221012 is an abundant number, since it is smaller than the sum of its proper divisors (17373503892012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000202221012 is a wasteful number, since it uses less digits than its factorization.
12000202221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633549 (or 633547 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12000202221012 its reverse (21012220200021), we get a palindrome (33012422421033).
The spelling of 12000202221012 in words is "twelve trillion, two hundred two million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •