Base | Representation |
---|---|
bin | 1010111101100010110001… |
… | …0001100001000110111111 |
3 | 1120200012101221110221110002 |
4 | 2233120230101201012333 |
5 | 3034431324240202033 |
6 | 41344450014304515 |
7 | 2352521141235605 |
oct | 257305421410677 |
9 | 46605357427402 |
10 | 12052421022143 |
11 | 39274485086a7 |
12 | 1427a0b4b813b |
13 | 6956ccbc8998 |
14 | 2d94a9a81875 |
15 | 15d7a00e03e8 |
hex | af62c4611bf |
12052421022143 has 8 divisors (see below), whose sum is σ = 12818612919168. Its totient is φ = 11292587564544.
The previous prime is 12052421022133. The next prime is 12052421022197. The reversal of 12052421022143 is 34122012425021.
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 12052421022143 - 210 = 12052421021119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12052421022133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1589605946 + ... + 1589613527.
It is an arithmetic number, because the mean of its divisors is an integer number (1602326614896).
Almost surely, 212052421022143 is an apocalyptic number.
12052421022143 is a deficient number, since it is larger than the sum of its proper divisors (766191897025).
12052421022143 is a wasteful number, since it uses less digits than its factorization.
12052421022143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3179219713.
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 12052421022143 its reverse (34122012425021), we get a palindrome (46174433447164).
The spelling of 12052421022143 in words is "twelve trillion, fifty-two billion, four hundred twenty-one million, twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •