Base | Representation |
---|---|
bin | 1011000110001100010001… |
… | …1001011011101101110111 |
3 | 1121012101220211000212101022 |
4 | 2301203010121123231313 |
5 | 3044400123020401403 |
6 | 41541021335051355 |
7 | 2366331130606214 |
oct | 261430431335567 |
9 | 47171824025338 |
10 | 12201002122103 |
11 | 3984463689193 |
12 | 1450776b10b5b |
13 | 6a671b50cb02 |
14 | 302762c00b0b |
15 | 162599344d38 |
hex | b18c465bb77 |
12201002122103 has 4 divisors (see below), whose sum is σ = 12621726333240. Its totient is φ = 11780277910968.
The previous prime is 12201002122093. The next prime is 12201002122171. The reversal of 12201002122103 is 30122120010221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12201002122103 - 26 = 12201002122039 is a prime.
It is a super-2 number, since 2×122010021221032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201002122193) 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, 210362105525 + ... + 210362105582.
It is an arithmetic number, because the mean of its divisors is an integer number (3155431583310).
Almost surely, 212201002122103 is an apocalyptic number.
12201002122103 is a deficient number, since it is larger than the sum of its proper divisors (420724211137).
12201002122103 is an equidigital number, since it uses as much as digits as its factorization.
12201002122103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 420724211136.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 12201002122103 its reverse (30122120010221), we get a palindrome (42323122132324).
The spelling of 12201002122103 in words is "twelve trillion, two hundred one billion, two million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •