Base | Representation |
---|---|
bin | 11100011110100000000100… |
… | …000011010010111001010101 |
3 | 121102102221201112100222000011 |
4 | 130132200010003102321111 |
5 | 112403423202431332203 |
6 | 1122211022052520221 |
7 | 35244246343643554 |
oct | 3436400403227125 |
9 | 542387645328004 |
10 | 125241314324053 |
11 | 369a65a79a1034 |
12 | 12068732920071 |
13 | 54b6288c743a5 |
14 | 22cd9d7873d9b |
15 | e72c323a276d |
hex | 71e8040d2e55 |
125241314324053 has 32 divisors (see below), whose sum is σ = 133145797317120. Its totient is φ = 117397500380160.
The previous prime is 125241314324039. The next prime is 125241314324057. The reversal of 125241314324053 is 350423413142521.
It is a de Polignac number, because none of the positive numbers 2k-125241314324053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125241314323997 and 125241314324015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125241314324057) 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, 22472868975 + ... + 22472874547.
It is an arithmetic number, because the mean of its divisors is an integer number (4160806166160).
Almost surely, 2125241314324053 is an apocalyptic number.
It is an amenable number.
125241314324053 is a deficient number, since it is larger than the sum of its proper divisors (7904482993067).
125241314324053 is a wasteful number, since it uses less digits than its factorization.
125241314324053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10077.
The product of its (nonzero) digits is 345600, while the sum is 40.
Adding to 125241314324053 its reverse (350423413142521), we get a palindrome (475664727466574).
The spelling of 125241314324053 in words is "one hundred twenty-five trillion, two hundred forty-one billion, three hundred fourteen million, three hundred twenty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •