Base | Representation |
---|---|
bin | 1011110111101100110101… |
… | …1011100111010111010011 |
3 | 1201012201100110111100110000 |
4 | 2331323031123213113103 |
5 | 3202314042121314101 |
6 | 43431445210341043 |
7 | 2514641516602545 |
oct | 275731533472723 |
9 | 51181313440400 |
10 | 13051557213651 |
11 | 4182152880480 |
12 | 156959012a783 |
13 | 7389ab230028 |
14 | 3319ad4ad695 |
15 | 17977aac8486 |
hex | bdecd6e75d3 |
13051557213651 has 40 divisors (see below), whose sum is σ = 21269556532224. Its totient is φ = 7909903698480.
The previous prime is 13051557213637. The next prime is 13051557213691. The reversal of 13051557213651 is 15631275515031.
13051557213651 is a `hidden beast` number, since 1 + 3 + 0 + 5 + 1 + 5 + 572 + 13 + 65 + 1 = 666.
It is not a de Polignac number, because 13051557213651 - 210 = 13051557212627 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13051557213597 and 13051557213606.
It is not an unprimeable number, because it can be changed into a prime (13051557213691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 101123706 + ... + 101252688.
Almost surely, 213051557213651 is an apocalyptic number.
13051557213651 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13051557213651 is a deficient number, since it is larger than the sum of its proper divisors (8217999318573).
13051557213651 is a wasteful number, since it uses less digits than its factorization.
13051557213651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242573 (or 242564 counting only the distinct ones).
The product of its (nonzero) digits is 472500, while the sum is 45.
The spelling of 13051557213651 in words is "thirteen trillion, fifty-one billion, five hundred fifty-seven million, two hundred thirteen thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •