Base | Representation |
---|---|
bin | 1011000001101111001000… |
… | …1010110100011000001001 |
3 | 1120221002100111201021110020 |
4 | 2300123302022310120021 |
5 | 3042121343410202221 |
6 | 41441522245211053 |
7 | 2360651302640445 |
oct | 260336212643011 |
9 | 46832314637406 |
10 | 12124460631561 |
11 | 3954a55a40493 |
12 | 1439975400a89 |
13 | 69c440a784c5 |
14 | 2dcb81503825 |
15 | 1605b97d9ac6 |
hex | b06f22b4609 |
12124460631561 has 4 divisors (see below), whose sum is σ = 16165947508752. Its totient is φ = 8082973754372.
The previous prime is 12124460631559. The next prime is 12124460631583. The reversal of 12124460631561 is 16513606442121.
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 12124460631561 - 21 = 12124460631559 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12124460631551) 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, 2020743438591 + ... + 2020743438596.
It is an arithmetic number, because the mean of its divisors is an integer number (4041486877188).
Almost surely, 212124460631561 is an apocalyptic number.
It is an amenable number.
12124460631561 is a deficient number, since it is larger than the sum of its proper divisors (4041486877191).
12124460631561 is an equidigital number, since it uses as much as digits as its factorization.
12124460631561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4041486877190.
The product of its (nonzero) digits is 207360, while the sum is 42.
The spelling of 12124460631561 in words is "twelve trillion, one hundred twenty-four billion, four hundred sixty million, six hundred thirty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •