Base | Representation |
---|---|
bin | 1010111010100111000001… |
… | …0000111101101101110111 |
3 | 1120111101022120001110101022 |
4 | 2232221300100331231313 |
5 | 3033120120130322221 |
6 | 41305353003051355 |
7 | 2346055203524006 |
oct | 256516020755567 |
9 | 46441276043338 |
10 | 12002022120311 |
11 | 390803565a813 |
12 | 141a0a4b10b5b |
13 | 690a2a610492 |
14 | 2d6c88394c3d |
15 | 15c3007024ab |
hex | aea7043db77 |
12002022120311 has 8 divisors (see below), whose sum is σ = 12390020970624. Its totient is φ = 11614075572960.
The previous prime is 12002022120299. The next prime is 12002022120409. The reversal of 12002022120311 is 11302122020021.
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-12002022120311 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 12002022120311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002022120211) 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, 12609116 + ... + 13527521.
It is an arithmetic number, because the mean of its divisors is an integer number (1548752621328).
Almost surely, 212002022120311 is an apocalyptic number.
12002022120311 is a deficient number, since it is larger than the sum of its proper divisors (387998850313).
12002022120311 is a wasteful number, since it uses less digits than its factorization.
12002022120311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26151481.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 12002022120311 its reverse (11302122020021), we get a palindrome (23304144140332).
The spelling of 12002022120311 in words is "twelve trillion, two billion, twenty-two million, one hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •