Base | Representation |
---|---|
bin | 11000010101001101… |
… | …00111001101110111 |
3 | 1020201100221210120212 |
4 | 30022212213031313 |
5 | 203223033434101 |
6 | 10000113020035 |
7 | 641464635536 |
oct | 141246471567 |
9 | 36640853525 |
10 | 13062796151 |
11 | 55a36760a9 |
12 | 264685461b |
13 | 13023ba5a2 |
14 | 8bcc3431d |
15 | 516c081bb |
hex | 30a9a7377 |
13062796151 has 16 divisors (see below), whose sum is σ = 14091399168. Its totient is φ = 12084660000.
The previous prime is 13062796147. The next prime is 13062796183. The reversal of 13062796151 is 15169726031.
It is a cyclic number.
It is not a de Polignac number, because 13062796151 - 22 = 13062796147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13062796099 and 13062796108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13062796451) 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 15 ways as a sum of consecutive naturals, for example, 41600 + ... + 166901.
It is an arithmetic number, because the mean of its divisors is an integer number (880712448).
Almost surely, 213062796151 is an apocalyptic number.
13062796151 is a deficient number, since it is larger than the sum of its proper divisors (1028603017).
13062796151 is a wasteful number, since it uses less digits than its factorization.
13062796151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208622.
The product of its (nonzero) digits is 68040, while the sum is 41.
The spelling of 13062796151 in words is "thirteen billion, sixty-two million, seven hundred ninety-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •