Base | Representation |
---|---|
bin | 11000011011101010… |
… | …01111100101001111 |
3 | 1020212010212202202001 |
4 | 30031311033211033 |
5 | 203330420310101 |
6 | 10005330013131 |
7 | 643023230035 |
oct | 141565174517 |
9 | 36763782661 |
10 | 13116963151 |
11 | 5621202616 |
12 | 2660a171a7 |
13 | 13106a4576 |
14 | 8c60d4555 |
15 | 51b857901 |
hex | 30dd4f94f |
13116963151 has 8 divisors (see below), whose sum is σ = 13143172544. Its totient is φ = 13090775040.
The previous prime is 13116963127. The next prime is 13116963157. The reversal of 13116963151 is 15136961131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13116963151 - 211 = 13116961103 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13116963151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13116963157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1793935 + ... + 1801231.
It is an arithmetic number, because the mean of its divisors is an integer number (1642896568).
Almost surely, 213116963151 is an apocalyptic number.
13116963151 is a deficient number, since it is larger than the sum of its proper divisors (26209393).
13116963151 is an equidigital number, since it uses as much as digits as its factorization.
13116963151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10641.
The product of its digits is 14580, while the sum is 37.
The spelling of 13116963151 in words is "thirteen billion, one hundred sixteen million, nine hundred sixty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •