Base | Representation |
---|---|
bin | 1100000111111110010101… |
… | …0110101110101010010011 |
3 | 1202012102222110202121001122 |
4 | 3001333211112232222103 |
5 | 3221404124123211433 |
6 | 44204123124552455 |
7 | 2544066602515562 |
oct | 301774526565223 |
9 | 52172873677048 |
10 | 13331131460243 |
11 | 427a779192933 |
12 | 15b37b4b5272b |
13 | 7591743c65cc |
14 | 34133197dbd9 |
15 | 181b8ee6c198 |
hex | c1fe55aea93 |
13331131460243 has 4 divisors (see below), whose sum is σ = 13518893875248. Its totient is φ = 13143369045240.
The previous prime is 13331131460131. The next prime is 13331131460261. The reversal of 13331131460243 is 34206413113331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13331131460243 - 220 = 13331130411667 is a prime.
It is a super-2 number, since 2×133311314602432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13331131465243) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 93881207396 + ... + 93881207537.
It is an arithmetic number, because the mean of its divisors is an integer number (3379723468812).
Almost surely, 213331131460243 is an apocalyptic number.
13331131460243 is a deficient number, since it is larger than the sum of its proper divisors (187762415005).
13331131460243 is an equidigital number, since it uses as much as digits as its factorization.
13331131460243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187762415004.
The product of its (nonzero) digits is 46656, while the sum is 35.
Adding to 13331131460243 its reverse (34206413113331), we get a palindrome (47537544573574).
The spelling of 13331131460243 in words is "thirteen trillion, three hundred thirty-one billion, one hundred thirty-one million, four hundred sixty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •