Base | Representation |
---|---|
bin | 1011000110110001111110… |
… | …0110001010110111011001 |
3 | 1121020101001002121010200202 |
4 | 2301230133212022313121 |
5 | 3100031334230402301 |
6 | 41545413445511545 |
7 | 2400136663312532 |
oct | 261543746126731 |
9 | 47211032533622 |
10 | 12211122122201 |
11 | 3988787105032 |
12 | 14527201125b5 |
13 | 6a7672024252 |
14 | 303042c7d689 |
15 | 16298ca0866b |
hex | b1b1f98add9 |
12211122122201 has 8 divisors (see below), whose sum is σ = 12480518945664. Its totient is φ = 11942124703600.
The previous prime is 12211122122167. The next prime is 12211122122231. The reversal of 12211122122201 is 10222122111221.
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 12211122122201 - 218 = 12211121860057 is a prime.
It is a super-2 number, since 2×122111221222012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12211122122231) 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, 99789395 + ... + 99911688.
It is an arithmetic number, because the mean of its divisors is an integer number (1560064868208).
Almost surely, 212211122122201 is an apocalyptic number.
It is an amenable number.
12211122122201 is a deficient number, since it is larger than the sum of its proper divisors (269396823463).
12211122122201 is a wasteful number, since it uses less digits than its factorization.
12211122122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199702431.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 12211122122201 its reverse (10222122111221), we get a palindrome (22433244233422).
The spelling of 12211122122201 in words is "twelve trillion, two hundred eleven billion, one hundred twenty-two million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •