Base | Representation |
---|---|
bin | 1011010001110110001011… |
… | …1011101101010111100001 |
3 | 1121220112202001212102110021 |
4 | 2310131202323231113201 |
5 | 3111140204440344131 |
6 | 42213014022033441 |
7 | 2416650023116264 |
oct | 264354273552741 |
9 | 47815661772407 |
10 | 12401230403041 |
11 | 3a51372299217 |
12 | 1483536b78881 |
13 | 6bc57ac0895c |
14 | 30c319346cdb |
15 | 1678b785ce11 |
hex | b4762eed5e1 |
12401230403041 has 8 divisors (see below), whose sum is σ = 12941554429440. Its totient is φ = 11861001384672.
The previous prime is 12401230403033. The next prime is 12401230403053. The reversal of 12401230403041 is 14030403210421.
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 12401230403041 - 23 = 12401230403033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12401230402997 and 12401230403015.
It is not an unprimeable number, because it can be changed into a prime (12401230403641) 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, 23485201 + ... + 24007438.
It is an arithmetic number, because the mean of its divisors is an integer number (1617694303680).
Almost surely, 212401230403041 is an apocalyptic number.
It is an amenable number.
12401230403041 is a deficient number, since it is larger than the sum of its proper divisors (540324026399).
12401230403041 is a wasteful number, since it uses less digits than its factorization.
12401230403041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47504015.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 12401230403041 its reverse (14030403210421), we get a palindrome (26431633613462).
The spelling of 12401230403041 in words is "twelve trillion, four hundred one billion, two hundred thirty million, four hundred three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •