Base | Representation |
---|---|
bin | 11001100000101100… |
… | …11001000101000111 |
3 | 1022100111120212011202 |
4 | 30300112121011013 |
5 | 211022144000101 |
6 | 10143014253115 |
7 | 663254513000 |
oct | 146026310507 |
9 | 38314525152 |
10 | 13696078151 |
11 | 5899096258 |
12 | 27a295719b |
13 | 13a3669c72 |
14 | 93cda21a7 |
15 | 5525ec36b |
hex | 330599147 |
13696078151 has 8 divisors (see below), whose sum is σ = 15972103200. Its totient is φ = 11739495264.
The previous prime is 13696078141. The next prime is 13696078171. The reversal of 13696078151 is 15187069631.
It is a de Polignac number, because none of the positive numbers 2k-13696078151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13696078096 and 13696078105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13696078141) 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, 19964786 + ... + 19965471.
It is an arithmetic number, because the mean of its divisors is an integer number (1996512900).
Almost surely, 213696078151 is an apocalyptic number.
13696078151 is a deficient number, since it is larger than the sum of its proper divisors (2276025049).
13696078151 is an frugal number, since it uses more digits than its factorization.
13696078151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39930278 (or 39930264 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 47.
The spelling of 13696078151 in words is "thirteen billion, six hundred ninety-six million, seventy-eight thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •