Base | Representation |
---|---|
bin | 1100001000101011010101… |
… | …1011010000000101001111 |
3 | 1202020121011101212212002112 |
4 | 3002022311123100011033 |
5 | 3222103344313204411 |
6 | 44213442002014235 |
7 | 2545005144460445 |
oct | 302126533200517 |
9 | 52217141785075 |
10 | 13343212241231 |
11 | 42849084a9454 |
12 | 15b600694737b |
13 | 75a34b202b22 |
14 | 341b5a1c8b95 |
15 | 18214a847b8b |
hex | c22b56d014f |
13343212241231 has 8 divisors (see below), whose sum is σ = 13806453855600. Its totient is φ = 12880179350080.
The previous prime is 13343212241207. The next prime is 13343212241273. The reversal of 13343212241231 is 13214221234331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13343212241231 - 214 = 13343212224847 is a prime.
It is a super-2 number, since 2×133432122412312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13343212241531) 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, 52050725 + ... + 52306446.
It is an arithmetic number, because the mean of its divisors is an integer number (1725806731950).
Almost surely, 213343212241231 is an apocalyptic number.
13343212241231 is a deficient number, since it is larger than the sum of its proper divisors (463241614369).
13343212241231 is a wasteful number, since it uses less digits than its factorization.
13343212241231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104361609.
The product of its digits is 20736, while the sum is 32.
Adding to 13343212241231 its reverse (13214221234331), we get a palindrome (26557433475562).
The spelling of 13343212241231 in words is "thirteen trillion, three hundred forty-three billion, two hundred twelve million, two hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •