Base | Representation |
---|---|
bin | 11000001111000011… |
… | …00100111010010101 |
3 | 1020120202202121121212 |
4 | 30013201210322111 |
5 | 203121323104331 |
6 | 5551025551205 |
7 | 640266621266 |
oct | 140741447225 |
9 | 36522677555 |
10 | 13011144341 |
11 | 55774a7358 |
12 | 26314a5505 |
13 | 12c47a43a0 |
14 | 8b602a96d |
15 | 512403d2b |
hex | 307864e95 |
13011144341 has 4 divisors (see below), whose sum is σ = 14012001612. Its totient is φ = 12010287072.
The previous prime is 13011144331. The next prime is 13011144353. The reversal of 13011144341 is 14344111031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14344111031 = 3529 ⋅4064639.
It can be written as a sum of positive squares in 2 ways, for example, as 3586812100 + 9424332241 = 59890^2 + 97079^2 .
It is a cyclic number.
It is not a de Polignac number, because 13011144341 - 210 = 13011143317 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13011144331) 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, 500428616 + ... + 500428641.
It is an arithmetic number, because the mean of its divisors is an integer number (3503000403).
Almost surely, 213011144341 is an apocalyptic number.
It is an amenable number.
13011144341 is a deficient number, since it is larger than the sum of its proper divisors (1000857271).
13011144341 is a wasteful number, since it uses less digits than its factorization.
13011144341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1000857270.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 13011144341 its reverse (14344111031), we get a palindrome (27355255372).
The spelling of 13011144341 in words is "thirteen billion, eleven million, one hundred forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •