Base | Representation |
---|---|
bin | 11000011101010001… |
… | …10001110001110101 |
3 | 1020220002022010011201 |
4 | 30032220301301311 |
5 | 203342400110230 |
6 | 10010531332501 |
7 | 643246114060 |
oct | 141650616165 |
9 | 36802263151 |
10 | 13130472565 |
11 | 562889a421 |
12 | 2665451131 |
13 | 13134245c2 |
14 | 8c7c0d8d7 |
15 | 51cb255ca |
hex | 30ea31c75 |
13130472565 has 32 divisors (see below), whose sum is σ = 18238328064. Its totient is φ = 8889054720.
The previous prime is 13130472547. The next prime is 13130472611. The reversal of 13130472565 is 56527403131.
13130472565 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13130472565 - 215 = 13130439797 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 895977 + ... + 910513.
It is an arithmetic number, because the mean of its divisors is an integer number (569947752).
Almost surely, 213130472565 is an apocalyptic number.
It is an amenable number.
13130472565 is a deficient number, since it is larger than the sum of its proper divisors (5107855499).
13130472565 is a wasteful number, since it uses less digits than its factorization.
13130472565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14877.
The product of its (nonzero) digits is 75600, while the sum is 37.
Adding to 13130472565 its reverse (56527403131), we get a palindrome (69657875696).
The spelling of 13130472565 in words is "thirteen billion, one hundred thirty million, four hundred seventy-two thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •