Base | Representation |
---|---|
bin | 1011000110010000011100… |
… | …1001011011101011100001 |
3 | 1121012111210212021121120222 |
4 | 2301210013021123223201 |
5 | 3044404421213013441 |
6 | 41541324422012425 |
7 | 2366400646455503 |
oct | 261440711335341 |
9 | 47174725247528 |
10 | 12202122001121 |
11 | 3984988840938 |
12 | 1450a29b77115 |
13 | 6a6869530b10 |
14 | 30282b835d73 |
15 | 162612805d4b |
hex | b190725bae1 |
12202122001121 has 8 divisors (see below), whose sum is σ = 13712083586880. Its totient is φ = 10773779960592.
The previous prime is 12202122001117. The next prime is 12202122001231. The reversal of 12202122001121 is 12110022120221.
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 12202122001121 - 22 = 12202122001117 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 12202122001121.
It is not an unprimeable number, because it can be changed into a prime (12202122001621) 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, 20404885991 + ... + 20404886588.
It is an arithmetic number, because the mean of its divisors is an integer number (1714010448360).
Almost surely, 212202122001121 is an apocalyptic number.
It is an amenable number.
12202122001121 is a deficient number, since it is larger than the sum of its proper divisors (1509961585759).
12202122001121 is a wasteful number, since it uses less digits than its factorization.
12202122001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40809772615.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12202122001121 its reverse (12110022120221), we get a palindrome (24312144121342).
The spelling of 12202122001121 in words is "twelve trillion, two hundred two billion, one hundred twenty-two million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •