Base | Representation |
---|---|
bin | 10110011000111101… |
… | …01010000011001101 |
3 | 1011000201201211220110 |
4 | 23030132222003031 |
5 | 144104223220323 |
6 | 5304441310233 |
7 | 603610522116 |
oct | 131436520315 |
9 | 34021654813 |
10 | 12020523213 |
11 | 51092aa006 |
12 | 23b5795379 |
13 | 119749c13a |
14 | 82064120d |
15 | 4a5476793 |
hex | 2cc7aa0cd |
12020523213 has 8 divisors (see below), whose sum is σ = 16418275776. Its totient is φ = 7818226400.
The previous prime is 12020523209. The next prime is 12020523239. The reversal of 12020523213 is 31232502021.
12020523213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12020523213 - 22 = 12020523209 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12020523213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12020523253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48863793 + ... + 48864038.
It is an arithmetic number, because the mean of its divisors is an integer number (2052284472).
Almost surely, 212020523213 is an apocalyptic number.
It is an amenable number.
12020523213 is a deficient number, since it is larger than the sum of its proper divisors (4397752563).
12020523213 is an equidigital number, since it uses as much as digits as its factorization.
12020523213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97727875.
The product of its (nonzero) digits is 720, while the sum is 21.
The spelling of 12020523213 in words is "twelve billion, twenty million, five hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •