Base | Representation |
---|---|
bin | 1011000001110110000010… |
… | …0001001001010110101101 |
3 | 1120221021010112100102220011 |
4 | 2300131200201021112231 |
5 | 3042134141331302123 |
6 | 41442430102053221 |
7 | 2361045213062233 |
oct | 260354041112655 |
9 | 46837115312804 |
10 | 12126311978413 |
11 | 3955815a85806 |
12 | 143a1b141a211 |
13 | 69c6774a5a09 |
14 | 2dccb9344953 |
15 | 1606770d6e0d |
hex | b07608495ad |
12126311978413 has 4 divisors (see below), whose sum is σ = 12126478322368. Its totient is φ = 12126145634460.
The previous prime is 12126311978401. The next prime is 12126311978437. The reversal of 12126311978413 is 31487911362121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12126311978413 - 221 = 12126309881261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12126311978113) 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 3 ways as a sum of consecutive naturals, for example, 83062581 + ... + 83208442.
It is an arithmetic number, because the mean of its divisors is an integer number (3031619580592).
Almost surely, 212126311978413 is an apocalyptic number.
It is an amenable number.
12126311978413 is a deficient number, since it is larger than the sum of its proper divisors (166343955).
12126311978413 is an equidigital number, since it uses as much as digits as its factorization.
12126311978413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166343954.
The product of its digits is 435456, while the sum is 49.
The spelling of 12126311978413 in words is "twelve trillion, one hundred twenty-six billion, three hundred eleven million, nine hundred seventy-eight thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •