Base | Representation |
---|---|
bin | 11000101001011011… |
… | …01001001000000101 |
3 | 1021011012010010121112 |
4 | 30110231221020011 |
5 | 204044444124031 |
6 | 10025012254405 |
7 | 645624432065 |
oct | 142455511005 |
9 | 37135103545 |
10 | 13232411141 |
11 | 5680395384 |
12 | 2693611405 |
13 | 132b5965a1 |
14 | 8d75873a5 |
15 | 526a5e62b |
hex | 314b69205 |
13232411141 has 4 divisors (see below), whose sum is σ = 13235648172. Its totient is φ = 13229174112.
The previous prime is 13232411119. The next prime is 13232411147. The reversal of 13232411141 is 14111423231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14111423231 = 31 ⋅455207201.
It can be written as a sum of positive squares in 2 ways, for example, as 4345578241 + 8886832900 = 65921^2 + 94270^2 .
It is a cyclic number.
It is not a de Polignac number, because 13232411141 - 230 = 12158669317 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 (13232411147) 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, 1612376 + ... + 1620561.
It is an arithmetic number, because the mean of its divisors is an integer number (3308912043).
Almost surely, 213232411141 is an apocalyptic number.
It is an amenable number.
13232411141 is a deficient number, since it is larger than the sum of its proper divisors (3237031).
13232411141 is an equidigital number, since it uses as much as digits as its factorization.
13232411141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3237030.
The product of its digits is 576, while the sum is 23.
Adding to 13232411141 its reverse (14111423231), we get a palindrome (27343834372).
The spelling of 13232411141 in words is "thirteen billion, two hundred thirty-two million, four hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •