Base | Representation |
---|---|
bin | 1011111011111100001111… |
… | …1011111000001100000001 |
3 | 1201110200101212021101112120 |
4 | 2332333003323320030001 |
5 | 3210012244024434131 |
6 | 43525134412514453 |
7 | 2523131113150566 |
oct | 276770373701401 |
9 | 51420355241476 |
10 | 13124412343041 |
11 | 420003968450a |
12 | 157b72317ba29 |
13 | 74281c03794c |
14 | 33532137a86d |
15 | 17b5e1bb3496 |
hex | befc3ef8301 |
13124412343041 has 32 divisors (see below), whose sum is σ = 18791136718848. Its totient is φ = 8118254081280.
The previous prime is 13124412343039. The next prime is 13124412343061. The reversal of 13124412343041 is 14034321442131.
It is a happy number.
It is not a de Polignac number, because 13124412343041 - 21 = 13124412343039 is a prime.
It is a super-2 number, since 2×131244123430412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13124412342993 and 13124412343011.
It is not an unprimeable number, because it can be changed into a prime (13124412343061) 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, 44474520 + ... + 44768646.
It is an arithmetic number, because the mean of its divisors is an integer number (587223022464).
Almost surely, 213124412343041 is an apocalyptic number.
It is an amenable number.
13124412343041 is a deficient number, since it is larger than the sum of its proper divisors (5666724375807).
13124412343041 is a wasteful number, since it uses less digits than its factorization.
13124412343041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306541.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 13124412343041 its reverse (14034321442131), we get a palindrome (27158733785172).
The spelling of 13124412343041 in words is "thirteen trillion, one hundred twenty-four billion, four hundred twelve million, three hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •