Base | Representation |
---|---|
bin | 1011000110001100010001… |
… | …0010001011110110101001 |
3 | 1121012101220200110100002121 |
4 | 2301203010102023312221 |
5 | 3044400122024101441 |
6 | 41541021230231241 |
7 | 2366331105504004 |
oct | 261430422136651 |
9 | 47171820410077 |
10 | 12201000222121 |
11 | 3984462600757 |
12 | 1450776355521 |
13 | 6a671acc6069 |
14 | 30276286853b |
15 | 1625990bbdd1 |
hex | b18c448bda9 |
12201000222121 has 8 divisors (see below), whose sum is σ = 12910795092864. Its totient is φ = 11506148401440.
The previous prime is 12201000222091. The next prime is 12201000222163. The reversal of 12201000222121 is 12122200010221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12201000222121 - 215 = 12201000189353 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12201000222095 and 12201000222104.
It is not an unprimeable number, because it can be changed into a prime (12201000222821) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3735760836 + ... + 3735764101.
It is an arithmetic number, because the mean of its divisors is an integer number (1613849386608).
Almost surely, 212201000222121 is an apocalyptic number.
It is an amenable number.
12201000222121 is a deficient number, since it is larger than the sum of its proper divisors (709794870743).
12201000222121 is an equidigital number, since it uses as much as digits as its factorization.
12201000222121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7471525031.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12201000222121 its reverse (12122200010221), we get a palindrome (24323200232342).
The spelling of 12201000222121 in words is "twelve trillion, two hundred one billion, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •