Base | Representation |
---|---|
bin | 1011110111010001100101… |
… | …0110111100100000001101 |
3 | 1201012000110120222110021020 |
4 | 2331310121112330200031 |
5 | 3202204101211421331 |
6 | 43424235221224353 |
7 | 2514262312060311 |
oct | 275643126744015 |
9 | 51160416873236 |
10 | 13044241123341 |
11 | 417a03906254a |
12 | 1568089b620b9 |
13 | 7380b35b45cc |
14 | 3314b7991b41 |
15 | 17949d672c96 |
hex | bdd195bc80d |
13044241123341 has 96 divisors (see below), whose sum is σ = 18976562841600. Its totient is φ = 7939855303680.
The previous prime is 13044241123337. The next prime is 13044241123343. The reversal of 13044241123341 is 14332114244031.
It is a happy number.
It is not a de Polignac number, because 13044241123341 - 22 = 13044241123337 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13044241123343) 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 95 ways as a sum of consecutive naturals, for example, 30265060396 + ... + 30265060826.
It is an arithmetic number, because the mean of its divisors is an integer number (197672529600).
Almost surely, 213044241123341 is an apocalyptic number.
It is an amenable number.
13044241123341 is a deficient number, since it is larger than the sum of its proper divisors (5932321718259).
13044241123341 is a wasteful number, since it uses less digits than its factorization.
13044241123341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1187 (or 918 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 13044241123341 its reverse (14332114244031), we get a palindrome (27376355367372).
The spelling of 13044241123341 in words is "thirteen trillion, forty-four billion, two hundred forty-one million, one hundred twenty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •