Base | Representation |
---|---|
bin | 11100011110100010000001… |
… | …000111110001110111111001 |
3 | 121102110011010202202001011000 |
4 | 130132202001013301313321 |
5 | 112403442002114322023 |
6 | 1122212010211155213 |
7 | 35244352343303412 |
oct | 3436420107616771 |
9 | 542404122661130 |
10 | 125243412651513 |
11 | 369a7484397562 |
12 | 120690195a5b09 |
13 | 54b65318c7b80 |
14 | 22cdb56406809 |
15 | e72d066d9243 |
hex | 71e8811f1df9 |
125243412651513 has 64 divisors (see below), whose sum is σ = 201788046028800. Its totient is φ = 76313935460160.
The previous prime is 125243412651499. The next prime is 125243412651517. The reversal of 125243412651513 is 315156214342521.
125243412651513 is a `hidden beast` number, since 1 + 2 + 5 + 2 + 4 + 3 + 4 + 126 + 5 + 1 + 513 = 666.
It is not a de Polignac number, because 125243412651513 - 214 = 125243412635129 is a prime.
It is not an unprimeable number, because it can be changed into a prime (125243412651517) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 73482768 + ... + 75167838.
It is an arithmetic number, because the mean of its divisors is an integer number (3152938219200).
Almost surely, 2125243412651513 is an apocalyptic number.
125243412651513 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
125243412651513 is a deficient number, since it is larger than the sum of its proper divisors (76544633377287).
125243412651513 is a wasteful number, since it uses less digits than its factorization.
125243412651513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1687179 (or 1687173 counting only the distinct ones).
The product of its digits is 864000, while the sum is 45.
The spelling of 125243412651513 in words is "one hundred twenty-five trillion, two hundred forty-three billion, four hundred twelve million, six hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •