Base | Representation |
---|---|
bin | 1011000110001000100101… |
… | …0001001101100000101101 |
3 | 1121012022100200101111000010 |
4 | 2301202021101031200231 |
5 | 3044341110042023041 |
6 | 41540335100523433 |
7 | 2366264423630505 |
oct | 261421121154055 |
9 | 47168320344003 |
10 | 12200010111021 |
11 | 3983aa4721617 |
12 | 145053a850579 |
13 | 6a65c0b3bcc5 |
14 | 3026ab172a05 |
15 | 16253c1e0a16 |
hex | b188944d82d |
12200010111021 has 8 divisors (see below), whose sum is σ = 16424609081920. Its totient is φ = 8054375607072.
The previous prime is 12200010110957. The next prime is 12200010111043. The reversal of 12200010111021 is 12011101000221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12200010111021 - 26 = 12200010110957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12200010110988 and 12200010111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200010115021) 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, 19741116376 + ... + 19741116993.
It is an arithmetic number, because the mean of its divisors is an integer number (2053076135240).
Almost surely, 212200010111021 is an apocalyptic number.
It is an amenable number.
12200010111021 is a deficient number, since it is larger than the sum of its proper divisors (4224598970899).
12200010111021 is a wasteful number, since it uses less digits than its factorization.
12200010111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39482233475.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12200010111021 its reverse (12011101000221), we get a palindrome (24211111111242).
The spelling of 12200010111021 in words is "twelve trillion, two hundred billion, ten million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •