Base | Representation |
---|---|
bin | 1011111011110100011001… |
… | …0101100000011001101111 |
3 | 1201110110222000011222121111 |
4 | 2332331012111200121233 |
5 | 3204443440103212033 |
6 | 43524145340012451 |
7 | 2523024645151564 |
oct | 276750625403157 |
9 | 51413860158544 |
10 | 13122305132143 |
11 | 41aa1581707a9 |
12 | 157b235531127 |
13 | 7425745c38ac |
14 | 3351a157486b |
15 | 17b51bbc47cd |
hex | bef4656066f |
13122305132143 has 8 divisors (see below), whose sum is σ = 13628707175936. Its totient is φ = 12621096955800.
The previous prime is 13122305132137. The next prime is 13122305132177. The reversal of 13122305132143 is 34123150322131.
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 13122305132143 - 221 = 13122303034991 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13122305132543) 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, 1298461713 + ... + 1298471818.
It is an arithmetic number, because the mean of its divisors is an integer number (1703588396992).
Almost surely, 213122305132143 is an apocalyptic number.
13122305132143 is a deficient number, since it is larger than the sum of its proper divisors (506402043793).
13122305132143 is a wasteful number, since it uses less digits than its factorization.
13122305132143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2596933725.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 13122305132143 its reverse (34123150322131), we get a palindrome (47245455454274).
The spelling of 13122305132143 in words is "thirteen trillion, one hundred twenty-two billion, three hundred five million, one hundred thirty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •