Base | Representation |
---|---|
bin | 1011011001100100110100… |
… | …1111101010110110100001 |
3 | 1122101020110202002101202111 |
4 | 2312121031033222312201 |
5 | 3120324123143214131 |
6 | 42354013412515321 |
7 | 2432360315402620 |
oct | 266311517526641 |
9 | 48336422071674 |
10 | 12534010523041 |
11 | 3aa270a1a7687 |
12 | 14a521291bb41 |
13 | 6cbc4ba69ab7 |
14 | 314913b3d6b7 |
15 | 16b0897d0ab1 |
hex | b664d3eada1 |
12534010523041 has 8 divisors (see below), whose sum is σ = 14348497622400. Its totient is φ = 10725501965568.
The previous prime is 12534010523039. The next prime is 12534010523077. The reversal of 12534010523041 is 14032501043521.
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 12534010523041 - 21 = 12534010523039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12534010522994 and 12534010523012.
It is not an unprimeable number, because it can be changed into a prime (12534010523081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1494630976 + ... + 1494639361.
It is an arithmetic number, because the mean of its divisors is an integer number (1793562202800).
Almost surely, 212534010523041 is an apocalyptic number.
It is an amenable number.
12534010523041 is a deficient number, since it is larger than the sum of its proper divisors (1814487099359).
12534010523041 is an equidigital number, since it uses as much as digits as its factorization.
12534010523041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2989270943.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 12534010523041 its reverse (14032501043521), we get a palindrome (26566511566562).
The spelling of 12534010523041 in words is "twelve trillion, five hundred thirty-four billion, ten million, five hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •