Base | Representation |
---|---|
bin | 1011011010111100000110… |
… | …0111000110110011111101 |
3 | 1122110110221102101021200000 |
4 | 2312233001213012303331 |
5 | 3121220113020113123 |
6 | 42412450205424513 |
7 | 2434150003650642 |
oct | 266570147066375 |
9 | 48413842337600 |
10 | 12557437660413 |
11 | 4001641207738 |
12 | 14a987056b139 |
13 | 70121347c569 |
14 | 315ad7257dc9 |
15 | 16b9ab364b43 |
hex | b6bc19c6cfd |
12557437660413 has 12 divisors (see below), whose sum is σ = 18810318141888. Its totient is φ = 8371625106780.
The previous prime is 12557437660393. The next prime is 12557437660447. The reversal of 12557437660413 is 31406673475521.
12557437660413 is a `hidden beast` number, since 1 + 2 + 5 + 574 + 3 + 7 + 6 + 60 + 4 + 1 + 3 = 666.
It is a de Polignac number, because none of the positive numbers 2k-12557437660413 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12557437660413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12557437660213) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25838348853 + ... + 25838349338.
It is an arithmetic number, because the mean of its divisors is an integer number (1567526511824).
Almost surely, 212557437660413 is an apocalyptic number.
It is an amenable number.
12557437660413 is a deficient number, since it is larger than the sum of its proper divisors (6252880481475).
12557437660413 is an frugal number, since it uses more digits than its factorization.
12557437660413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51676698206 (or 51676698194 counting only the distinct ones).
The product of its (nonzero) digits is 12700800, while the sum is 54.
The spelling of 12557437660413 in words is "twelve trillion, five hundred fifty-seven billion, four hundred thirty-seven million, six hundred sixty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •