Base | Representation |
---|---|
bin | 11000111110101010… |
… | …10010101101010000 |
3 | 1021121121100220112122 |
4 | 30133111102231100 |
5 | 204431101432412 |
6 | 10054415113412 |
7 | 653220011543 |
oct | 143725225520 |
9 | 37547326478 |
10 | 13410577232 |
11 | 5761a15188 |
12 | 2723212868 |
13 | 1359477800 |
14 | 9130c485a |
15 | 537504572 |
hex | 31f552b50 |
13410577232 has 30 divisors (see below), whose sum is σ = 28135436382. Its totient is φ = 6189495936.
The previous prime is 13410577231. The next prime is 13410577241. The reversal of 13410577232 is 23277501431.
It is a happy number.
13410577232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 1975269136 + 11435308096 = 44444^2 + 106936^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13410577192 and 13410577201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13410577231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2477063 + ... + 2482470.
Almost surely, 213410577232 is an apocalyptic number.
It is an amenable number.
13410577232 is an abundant number, since it is smaller than the sum of its proper divisors (14724859150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13410577232 is a wasteful number, since it uses less digits than its factorization.
13410577232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4959567 (or 4959548 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 35.
The spelling of 13410577232 in words is "thirteen billion, four hundred ten million, five hundred seventy-seven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •