Base | Representation |
---|---|
bin | 1010111010100111101011… |
… | …1011011000101101101101 |
3 | 1120111101210000200011011012 |
4 | 2232221322323120231231 |
5 | 3033121001424404401 |
6 | 41305422433235005 |
7 | 2346062505221225 |
oct | 256517273305555 |
9 | 46441700604135 |
10 | 12002201013101 |
11 | 39081176365a2 |
12 | 141a134a02a65 |
13 | 690a586b73c0 |
14 | 2d6ca4041085 |
15 | 15c31128c8bb |
hex | aea7aed8b6d |
12002201013101 has 4 divisors (see below), whose sum is σ = 12925447244892. Its totient is φ = 11078954781312.
The previous prime is 12002201013073. The next prime is 12002201013109. The reversal of 12002201013101 is 10131010220021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3279032856100 + 8723168157001 = 1810810^2 + 2953501^2 .
It is a cyclic number.
It is not a de Polignac number, because 12002201013101 - 26 = 12002201013037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002201013109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 461623115876 + ... + 461623115901.
It is an arithmetic number, because the mean of its divisors is an integer number (3231361811223).
Almost surely, 212002201013101 is an apocalyptic number.
It is an amenable number.
12002201013101 is a deficient number, since it is larger than the sum of its proper divisors (923246231791).
12002201013101 is an equidigital number, since it uses as much as digits as its factorization.
12002201013101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 923246231790.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 12002201013101 its reverse (10131010220021), we get a palindrome (22133211233122).
The spelling of 12002201013101 in words is "twelve trillion, two billion, two hundred one million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •