Base | Representation |
---|---|
bin | 1011000000111101110001… |
… | …1000011100010000001001 |
3 | 1120212211011001200201101022 |
4 | 2300033130120130100021 |
5 | 3041412224302431441 |
6 | 41431451350402225 |
7 | 2360002036102022 |
oct | 260173430342011 |
9 | 46784131621338 |
10 | 12111210202121 |
11 | 394a376469758 |
12 | 1437297960375 |
13 | 69b10b843804 |
14 | 2dc2857c9c49 |
15 | 1600913bb84b |
hex | b03dc61c409 |
12111210202121 has 8 divisors (see below), whose sum is σ = 12146603414400. Its totient is φ = 12075820936848.
The previous prime is 12111210202111. The next prime is 12111210202213. The reversal of 12111210202121 is 12120201211121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12111210202121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12111210202121.
It is not an unprimeable number, because it can be changed into a prime (12111210202111) 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, 5216000 + ... + 7171406.
It is an arithmetic number, because the mean of its divisors is an integer number (1518325426800).
Almost surely, 212111210202121 is an apocalyptic number.
It is an amenable number.
12111210202121 is a deficient number, since it is larger than the sum of its proper divisors (35393212279).
12111210202121 is a wasteful number, since it uses less digits than its factorization.
12111210202121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1973503.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12111210202121 its reverse (12120201211121), we get a palindrome (24231411413242).
The spelling of 12111210202121 in words is "twelve trillion, one hundred eleven billion, two hundred ten million, two hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •