Base | Representation |
---|---|
bin | 11100100001010100100100… |
… | …011101010100001101101111 |
3 | 121110010110222222122220022201 |
4 | 130201110210131110031233 |
5 | 112420112122133410211 |
6 | 1122440034240322331 |
7 | 35264250331066162 |
oct | 3441244435241557 |
9 | 543113888586281 |
10 | 125435131544431 |
11 | 36a70816740405 |
12 | 1209a2039133a7 |
13 | 54cb63638c687 |
14 | 22d9142767ad9 |
15 | e77cc7b370c1 |
hex | 72152475436f |
125435131544431 has 16 divisors (see below), whose sum is σ = 131056438993920. Its totient is φ = 119827804465600.
The previous prime is 125435131544417. The next prime is 125435131544449. The reversal of 125435131544431 is 134445131534521.
It is a cyclic number.
It is not a de Polignac number, because 125435131544431 - 29 = 125435131543919 is a prime.
It is a super-2 number, since 2×1254351315444312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125435131524431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 456683166 + ... + 456957748.
It is an arithmetic number, because the mean of its divisors is an integer number (8191027437120).
Almost surely, 2125435131544431 is an apocalyptic number.
125435131544431 is a deficient number, since it is larger than the sum of its proper divisors (5621307449489).
125435131544431 is a wasteful number, since it uses less digits than its factorization.
125435131544431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299966.
The product of its digits is 1728000, while the sum is 46.
The spelling of 125435131544431 in words is "one hundred twenty-five trillion, four hundred thirty-five billion, one hundred thirty-one million, five hundred forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •