Base | Representation |
---|---|
bin | 111010010000100101… |
… | …0110110001010100101 |
3 | 102221221011120002120022 |
4 | 1310201022312022211 |
5 | 4022211244334023 |
6 | 133250333044525 |
7 | 12016233032501 |
oct | 1644112661245 |
9 | 387834502508 |
10 | 125110543013 |
11 | 49071704795 |
12 | 202b7326745 |
13 | ba4ac0b511 |
14 | 60abd81301 |
15 | 33c39957c8 |
hex | 1d212b62a5 |
125110543013 has 4 divisors (see below), whose sum is σ = 125367444000. Its totient is φ = 124853642028.
The previous prime is 125110543007. The next prime is 125110543027. The reversal of 125110543013 is 310345011521.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 125110543013 - 28 = 125110542757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125110503013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128449763 + ... + 128450736.
It is an arithmetic number, because the mean of its divisors is an integer number (31341861000).
Almost surely, 2125110543013 is an apocalyptic number.
It is an amenable number.
125110543013 is a deficient number, since it is larger than the sum of its proper divisors (256900987).
125110543013 is an equidigital number, since it uses as much as digits as its factorization.
125110543013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256900986.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 125110543013 its reverse (310345011521), we get a palindrome (435455554534).
The spelling of 125110543013 in words is "one hundred twenty-five billion, one hundred ten million, five hundred forty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •