Base | Representation |
---|---|
bin | 11000011011101010… |
… | …01101111010100101 |
3 | 1020212010212102101020 |
4 | 30031311031322211 |
5 | 203330420100300 |
6 | 10005325521353 |
7 | 643023201114 |
oct | 141565157245 |
9 | 36763772336 |
10 | 13116956325 |
11 | 56211a8480 |
12 | 2660a13259 |
13 | 13106a1425 |
14 | 8c60d1c7b |
15 | 51b8558a0 |
hex | 30dd4dea5 |
13116956325 has 48 divisors (see below), whose sum is σ = 23675288256. Its totient is φ = 6355148800.
The previous prime is 13116956311. The next prime is 13116956329. The reversal of 13116956325 is 52365961131.
It is not a de Polignac number, because 13116956325 - 215 = 13116923557 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13116956329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1325797 + ... + 1335653.
It is an arithmetic number, because the mean of its divisors is an integer number (493235172).
Almost surely, 213116956325 is an apocalyptic number.
13116956325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13116956325 is a deficient number, since it is larger than the sum of its proper divisors (10558331931).
13116956325 is a wasteful number, since it uses less digits than its factorization.
13116956325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11494 (or 11489 counting only the distinct ones).
The product of its digits is 145800, while the sum is 42.
The spelling of 13116956325 in words is "thirteen billion, one hundred sixteen million, nine hundred fifty-six thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •