Base | Representation |
---|---|
bin | 1011000111010011110111… |
… | …1000101000001100101101 |
3 | 1121021020112011020222122002 |
4 | 2301310331320220030231 |
5 | 3100204002333241023 |
6 | 41553520333302045 |
7 | 2400611306641652 |
oct | 261647570501455 |
9 | 47236464228562 |
10 | 12220220212013 |
11 | 3991625802620 |
12 | 145443b034925 |
13 | 6a8491bc9748 |
14 | 303667309c29 |
15 | 162d2160db28 |
hex | b1d3de2832d |
12220220212013 has 8 divisors (see below), whose sum is σ = 13331177682816. Its totient is φ = 11109267468000.
The previous prime is 12220220212009. The next prime is 12220220212073. The reversal of 12220220212013 is 31021202202221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12220220212013 - 22 = 12220220212009 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220220212073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6263420 + ... + 7979402.
It is an arithmetic number, because the mean of its divisors is an integer number (1666397210352).
Almost surely, 212220220212013 is an apocalyptic number.
It is an amenable number.
12220220212013 is a deficient number, since it is larger than the sum of its proper divisors (1110957470803).
12220220212013 is a wasteful number, since it uses less digits than its factorization.
12220220212013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2363395.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 12220220212013 its reverse (31021202202221), we get a palindrome (43241422414234).
The spelling of 12220220212013 in words is "twelve trillion, two hundred twenty billion, two hundred twenty million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •