Base | Representation |
---|---|
bin | 1010111011101110111010… |
… | …1100110100010000110101 |
3 | 1120120020010200110220200010 |
4 | 2232323232230310100311 |
5 | 3033424132221020041 |
6 | 41322304124410433 |
7 | 2350340411256513 |
oct | 256735654642065 |
9 | 46506120426603 |
10 | 12021323220021 |
11 | 391523a620695 |
12 | 14219909a6a19 |
13 | 6927b527243b |
14 | 2d7b9990b4b3 |
15 | 15ca7ee16a16 |
hex | aeeeeb34435 |
12021323220021 has 8 divisors (see below), whose sum is σ = 16049274176320. Its totient is φ = 8003793871872.
The previous prime is 12021323220007. The next prime is 12021323220041. The reversal of 12021323220021 is 12002232312021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12021323220021 - 29 = 12021323219509 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12021323220021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021323220041) 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, 2605399345 + ... + 2605403958.
It is an arithmetic number, because the mean of its divisors is an integer number (2006159272040).
Almost surely, 212021323220021 is an apocalyptic number.
It is an amenable number.
12021323220021 is a deficient number, since it is larger than the sum of its proper divisors (4027950956299).
12021323220021 is an equidigital number, since it uses as much as digits as its factorization.
12021323220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5210804075.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12021323220021 its reverse (12002232312021), we get a palindrome (24023555532042).
The spelling of 12021323220021 in words is "twelve trillion, twenty-one billion, three hundred twenty-three million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •