Base | Representation |
---|---|
bin | 1011000011101101101010… |
… | …1111000000100011110011 |
3 | 1121001100000200210221001021 |
4 | 2300323122233000203303 |
5 | 3043200424331010302 |
6 | 41505300534520311 |
7 | 2363263106020102 |
oct | 260733257004363 |
9 | 47040020727037 |
10 | 12158427203827 |
11 | 39683a6206a13 |
12 | 1444474806097 |
13 | 6a26c4b59a88 |
14 | 300684680039 |
15 | 161406784437 |
hex | b0edabc08f3 |
12158427203827 has 8 divisors (see below), whose sum is σ = 12364563916800. Its totient is φ = 11952292546824.
The previous prime is 12158427203789. The next prime is 12158427203869. The reversal of 12158427203827 is 72830272485121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12158427203827 - 211 = 12158427201779 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12158427203327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15727098 + ... + 16482064.
It is an arithmetic number, because the mean of its divisors is an integer number (1545570489600).
Almost surely, 212158427203827 is an apocalyptic number.
12158427203827 is a deficient number, since it is larger than the sum of its proper divisors (206136712973).
12158427203827 is an equidigital number, since it uses as much as digits as its factorization.
12158427203827 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1027985.
The product of its (nonzero) digits is 3010560, while the sum is 52.
Adding to 12158427203827 its reverse (72830272485121), we get a palindrome (84988699688948).
The spelling of 12158427203827 in words is "twelve trillion, one hundred fifty-eight billion, four hundred twenty-seven million, two hundred three thousand, eight hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •