Base | Representation |
---|---|
bin | 111010010100110100… |
… | …0000010111110101011 |
3 | 102222022001111221220021 |
4 | 1310221220002332223 |
5 | 4023004104243103 |
6 | 133312401541311 |
7 | 12022604651563 |
oct | 1645150027653 |
9 | 388261457807 |
10 | 125252415403 |
11 | 491347a55a5 |
12 | 20336944837 |
13 | ba71422b8b |
14 | 60c2b51da3 |
15 | 33d116bbbd |
hex | 1d29a02fab |
125252415403 has 4 divisors (see below), whose sum is σ = 129571464240. Its totient is φ = 120933366568.
The previous prime is 125252415371. The next prime is 125252415433. The reversal of 125252415403 is 304514252521.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 304514252521 = 37 ⋅8230114933.
It is a cyclic number.
It is not a de Polignac number, because 125252415403 - 25 = 125252415371 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125252415433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2159524375 + ... + 2159524432.
It is an arithmetic number, because the mean of its divisors is an integer number (32392866060).
Almost surely, 2125252415403 is an apocalyptic number.
125252415403 is a deficient number, since it is larger than the sum of its proper divisors (4319048837).
125252415403 is an equidigital number, since it uses as much as digits as its factorization.
125252415403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4319048836.
The product of its (nonzero) digits is 48000, while the sum is 34.
Adding to 125252415403 its reverse (304514252521), we get a palindrome (429766667924).
The spelling of 125252415403 in words is "one hundred twenty-five billion, two hundred fifty-two million, four hundred fifteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •