Base | Representation |
---|---|
bin | 1011001000100010100010… |
… | …0000101110010011111101 |
3 | 1121100021000210012112222220 |
4 | 2302020220200232103331 |
5 | 3101030224113214131 |
6 | 42011331535555553 |
7 | 2402256505044516 |
oct | 262105040562375 |
9 | 47307023175886 |
10 | 12241336460541 |
11 | 399a581334691 |
12 | 145855298bbb9 |
13 | 6aa478923a66 |
14 | 3046ab95da0d |
15 | 16365a36ee96 |
hex | b222882e4fd |
12241336460541 has 8 divisors (see below), whose sum is σ = 16321831812384. Its totient is φ = 8160866041200.
The previous prime is 12241336460537. The next prime is 12241336460581. The reversal of 12241336460541 is 14506463314221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12241336460541 - 22 = 12241336460537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12241336460493 and 12241336460502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12241336460581) 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, 5055735 + ... + 7074116.
It is an arithmetic number, because the mean of its divisors is an integer number (2040228976548).
Almost surely, 212241336460541 is an apocalyptic number.
It is an amenable number.
12241336460541 is a deficient number, since it is larger than the sum of its proper divisors (4080495351843).
12241336460541 is a wasteful number, since it uses less digits than its factorization.
12241336460541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12466251.
The product of its (nonzero) digits is 414720, while the sum is 42.
Adding to 12241336460541 its reverse (14506463314221), we get a palindrome (26747799774762).
The spelling of 12241336460541 in words is "twelve trillion, two hundred forty-one billion, three hundred thirty-six million, four hundred sixty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •