Base | Representation |
---|---|
bin | 1010111010100111101011… |
… | …1011011000101101110101 |
3 | 1120111101210000200011011111 |
4 | 2232221322323120231311 |
5 | 3033121001424404414 |
6 | 41305422433235021 |
7 | 2346062505221236 |
oct | 256517273305565 |
9 | 46441700604144 |
10 | 12002201013109 |
11 | 39081176365aa |
12 | 141a134a02a71 |
13 | 690a586b73c8 |
14 | 2d6ca404108d |
15 | 15c31128c8c4 |
hex | aea7aed8b75 |
12002201013109 has 2 divisors, whose sum is σ = 12002201013110. Its totient is φ = 12002201013108.
The previous prime is 12002201013073. The next prime is 12002201013119. The reversal of 12002201013109 is 90131010220021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6972847578225 + 5029353434884 = 2640615^2 + 2242622^2 .
It is a cyclic number.
It is not a de Polignac number, because 12002201013109 - 29 = 12002201012597 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12002201013109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12002201013119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001100506554 + 6001100506555.
It is an arithmetic number, because the mean of its divisors is an integer number (6001100506555).
Almost surely, 212002201013109 is an apocalyptic number.
It is an amenable number.
12002201013109 is a deficient number, since it is larger than the sum of its proper divisors (1).
12002201013109 is an equidigital number, since it uses as much as digits as its factorization.
12002201013109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 12002201013109 in words is "twelve trillion, two billion, two hundred one million, thirteen thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •