Base | Representation |
---|---|
bin | 1011000000111100111111… |
… | …1010011110011001110101 |
3 | 1120212210121111002011111010 |
4 | 2300033033322132121311 |
5 | 3041411312230120041 |
6 | 41431414515102433 |
7 | 2356663616062461 |
oct | 260171772363165 |
9 | 46783544064433 |
10 | 12111001020021 |
11 | 394a279385092 |
12 | 14372398a1a19 |
13 | 69b0a73c3017 |
14 | 2dc265ad74a1 |
15 | 16007cd4ba16 |
hex | b03cfe9e675 |
12111001020021 has 8 divisors (see below), whose sum is σ = 16541855051904. Its totient is φ = 7877073834080.
The previous prime is 12111001020017. The next prime is 12111001020031. The reversal of 12111001020021 is 12002010011121.
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 12111001020021 - 22 = 12111001020017 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12111001019979 and 12111001020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12111001020031) 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, 49231711341 + ... + 49231711586.
It is an arithmetic number, because the mean of its divisors is an integer number (2067731881488).
Almost surely, 212111001020021 is an apocalyptic number.
It is an amenable number.
12111001020021 is a deficient number, since it is larger than the sum of its proper divisors (4430854031883).
12111001020021 is an equidigital number, since it uses as much as digits as its factorization.
12111001020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98463422971.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12111001020021 its reverse (12002010011121), we get a palindrome (24113011031142).
The spelling of 12111001020021 in words is "twelve trillion, one hundred eleven billion, one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •