Base | Representation |
---|---|
bin | 1010111011001100001011… |
… | …1111101000101000011101 |
3 | 1120112100001221020022222110 |
4 | 2232303002333220220131 |
5 | 3033301034001133041 |
6 | 41314123040104233 |
7 | 2346560362344360 |
oct | 256630277505035 |
9 | 46470057208873 |
10 | 12012000021021 |
11 | 3911295950250 |
12 | 142000a605079 |
13 | 69195a860b40 |
14 | 2d75536040d7 |
15 | 15c6d6697516 |
hex | aecc2fe8a1d |
12012000021021 has 32 divisors (see below), whose sum is σ = 21504000043008. Its totient is φ = 5760000008640.
The previous prime is 12012000020987. The next prime is 12012000021041.
12012000021021 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 12012000021021 - 211 = 12012000018973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12012000020988 and 12012000021006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012000021041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1999997001 + ... + 2000003006.
It is an arithmetic number, because the mean of its divisors is an integer number (672000001344).
Almost surely, 212012000021021 is an apocalyptic number.
12012000021021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12012000021021 is a deficient number, since it is larger than the sum of its proper divisors (9492000021987).
12012000021021 is a wasteful number, since it uses less digits than its factorization.
12012000021021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4000000041.
The product of its (nonzero) digits is 16, while the sum is 12.
It can be divided in two parts, 120120000 and 21021, that added together give a palindrome (120141021).
The spelling of 12012000021021 in words is "twelve trillion, twelve billion, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •