Base | Representation |
---|---|
bin | 1011111011101100010001… |
… | …0110000100000010101001 |
3 | 1201110021100000110012001221 |
4 | 2332323010112010002221 |
5 | 3204430003301140131 |
6 | 43523145111542041 |
7 | 2522616623654560 |
oct | 276730426040251 |
9 | 51407300405057 |
10 | 13120124240041 |
11 | 41a9239102235 |
12 | 157a92708a921 |
13 | 7422b78225b0 |
14 | 335035a6cbd7 |
15 | 17b4404ce411 |
hex | beec45840a9 |
13120124240041 has 32 divisors (see below), whose sum is σ = 16998759187200. Its totient is φ = 9833807566080.
The previous prime is 13120124240009. The next prime is 13120124240053. The reversal of 13120124240041 is 14004242102131.
It is a cyclic number.
It is not a de Polignac number, because 13120124240041 - 25 = 13120124240009 is a prime.
It is a super-2 number, since 2×131201242400412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13120124239988 and 13120124240015.
It is not an unprimeable number, because it can be changed into a prime (13120124244041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29499051 + ... + 29940511.
It is an arithmetic number, because the mean of its divisors is an integer number (531211224600).
Almost surely, 213120124240041 is an apocalyptic number.
It is an amenable number.
13120124240041 is a deficient number, since it is larger than the sum of its proper divisors (3878634947159).
13120124240041 is a wasteful number, since it uses less digits than its factorization.
13120124240041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458689.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 13120124240041 its reverse (14004242102131), we get a palindrome (27124366342172).
The spelling of 13120124240041 in words is "thirteen trillion, one hundred twenty billion, one hundred twenty-four million, two hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •