Base | Representation |
---|---|
bin | 11000011101010011… |
… | …01111000101001001 |
3 | 1020220002202212121102 |
4 | 30032221233011021 |
5 | 203342431124112 |
6 | 10010540551145 |
7 | 643251211112 |
oct | 141651570511 |
9 | 36802685542 |
10 | 13130723657 |
11 | 5628a51037 |
12 | 26655524b5 |
13 | 13134b198c |
14 | 8c7c77209 |
15 | 51cb74bc2 |
hex | 30ea6f149 |
13130723657 has 2 divisors, whose sum is σ = 13130723658. Its totient is φ = 13130723656.
The previous prime is 13130723647. The next prime is 13130723677. The reversal of 13130723657 is 75632703131.
It is a happy number.
13130723657 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13091021056 + 39702601 = 114416^2 + 6301^2 .
It is a cyclic number.
It is not a de Polignac number, because 13130723657 - 28 = 13130723401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13130723657.
It is not a weakly prime, because it can be changed into another prime (13130723647) 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 as a sum of consecutive naturals, namely, 6565361828 + 6565361829.
It is an arithmetic number, because the mean of its divisors is an integer number (6565361829).
Almost surely, 213130723657 is an apocalyptic number.
It is an amenable number.
13130723657 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130723657 is an equidigital number, since it uses as much as digits as its factorization.
13130723657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 79380, while the sum is 38.
The spelling of 13130723657 in words is "thirteen billion, one hundred thirty million, seven hundred twenty-three thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •