Base | Representation |
---|---|
bin | 1010111010100000010011… |
… | …1011000101000010011111 |
3 | 1120111012200001100021222200 |
4 | 2232220010323011002133 |
5 | 3033102423113033043 |
6 | 41304454151342543 |
7 | 2345662445242530 |
oct | 256500473050237 |
9 | 46435601307880 |
10 | 12000221221023 |
11 | 39072a10414a2 |
12 | 1419881981a53 |
13 | 690801496cb9 |
14 | 2d6b57126687 |
15 | 15c24756c7d3 |
hex | aea04ec509f |
12000221221023 has 12 divisors (see below), whose sum is σ = 19809888999888. Its totient is φ = 6857269269120.
The previous prime is 12000221220991. The next prime is 12000221221081. The reversal of 12000221221023 is 32012212200021.
12000221221023 is a `hidden beast` number, since 1 + 200 + 0 + 221 + 221 + 0 + 23 = 666.
It is not a de Polignac number, because 12000221221023 - 25 = 12000221220991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12000221220987 and 12000221221005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12000221221523) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 95239850898 + ... + 95239851023.
It is an arithmetic number, because the mean of its divisors is an integer number (1650824083324).
Almost surely, 212000221221023 is an apocalyptic number.
12000221221023 is a deficient number, since it is larger than the sum of its proper divisors (7809667778865).
12000221221023 is a wasteful number, since it uses less digits than its factorization.
12000221221023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190479701934 (or 190479701931 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 12000221221023 its reverse (32012212200021), we get a palindrome (44012433421044).
The spelling of 12000221221023 in words is "twelve trillion, two hundred twenty-one million, two hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •