Base | Representation |
---|---|
bin | 11100011101111110010001… |
… | …011101101011101011101001 |
3 | 121102022111001222000012001011 |
4 | 130131332101131223223221 |
5 | 112402324401210414423 |
6 | 1122142221523223521 |
7 | 35241523262221225 |
oct | 3435762135535351 |
9 | 542274058005034 |
10 | 125205032123113 |
11 | 369921795aa4a8 |
12 | 120616a7b17ba1 |
13 | 54b2a26208137 |
14 | 22cbd54d5b785 |
15 | e71d0be9ab0d |
hex | 71df9176bae9 |
125205032123113 has 16 divisors (see below), whose sum is σ = 135171021473280. Its totient is φ = 115616949359296.
The previous prime is 125205032123023. The next prime is 125205032123153. The reversal of 125205032123113 is 311321230502521.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 125205032123113 - 217 = 125205031992041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125205032123153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6661345 + ... + 17169262.
It is an arithmetic number, because the mean of its divisors is an integer number (8448188842080).
Almost surely, 2125205032123113 is an apocalyptic number.
It is an amenable number.
125205032123113 is a deficient number, since it is larger than the sum of its proper divisors (9965989350167).
125205032123113 is a wasteful number, since it uses less digits than its factorization.
125205032123113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23838536.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 125205032123113 its reverse (311321230502521), we get a palindrome (436526262625634).
The spelling of 125205032123113 in words is "one hundred twenty-five trillion, two hundred five billion, thirty-two million, one hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •