Base | Representation |
---|---|
bin | 111010010110010001… |
… | …1010101111110011111 |
3 | 102222102110220102201010 |
4 | 1310230203111332133 |
5 | 4023104141423033 |
6 | 133321314150303 |
7 | 12024042203601 |
oct | 1645443257637 |
9 | 388373812633 |
10 | 125301514143 |
11 | 4915a490173 |
12 | 2034b282393 |
13 | ba7b653ca0 |
14 | 60c9493171 |
15 | 33d5619863 |
hex | 1d2c8d5f9f |
125301514143 has 64 divisors (see below), whose sum is σ = 193685184000. Its totient is φ = 71484166656.
The previous prime is 125301514103. The next prime is 125301514147. The reversal of 125301514143 is 341415103521.
It is not a de Polignac number, because 125301514143 - 216 = 125301448607 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 125301514143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125301514147) 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 63 ways as a sum of consecutive naturals, for example, 2847513 + ... + 2891181.
It is an arithmetic number, because the mean of its divisors is an integer number (3026331000).
Almost surely, 2125301514143 is an apocalyptic number.
125301514143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
125301514143 is a deficient number, since it is larger than the sum of its proper divisors (68383669857).
125301514143 is a wasteful number, since it uses less digits than its factorization.
125301514143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43816.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 125301514143 its reverse (341415103521), we get a palindrome (466716617664).
The spelling of 125301514143 in words is "one hundred twenty-five billion, three hundred one million, five hundred fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •