Base | Representation |
---|---|
bin | 1011100010111010111000… |
… | …1110010100111101001011 |
3 | 1122221120212002222110101211 |
4 | 2320232232032110331023 |
5 | 3130441420121213430 |
6 | 42555444003553551 |
7 | 2450102550050224 |
oct | 270565616247513 |
9 | 48846762873354 |
10 | 12694551351115 |
11 | 4054802322997 |
12 | 151035768b8b7 |
13 | 71112508521a |
14 | 31c5c33d624b |
15 | 17033399d72a |
hex | b8bae394f4b |
12694551351115 has 4 divisors (see below), whose sum is σ = 15233461621344. Its totient is φ = 10155641080888.
The previous prime is 12694551351059. The next prime is 12694551351133. The reversal of 12694551351115 is 51115315549621.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12694551351115 - 213 = 12694551342923 is a prime.
It is a super-2 number, since 2×126945513511152 (a number of 27 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1269455135107 + ... + 1269455135116.
It is an arithmetic number, because the mean of its divisors is an integer number (3808365405336).
Almost surely, 212694551351115 is an apocalyptic number.
12694551351115 is a deficient number, since it is larger than the sum of its proper divisors (2538910270229).
12694551351115 is an equidigital number, since it uses as much as digits as its factorization.
12694551351115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2538910270228.
The product of its digits is 810000, while the sum is 49.
The spelling of 12694551351115 in words is "twelve trillion, six hundred ninety-four billion, five hundred fifty-one million, three hundred fifty-one thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •