Base | Representation |
---|---|
bin | 111010001110110100… |
… | …0100100010010100011 |
3 | 102221210000221102220011 |
4 | 1310131220210102203 |
5 | 4022101103202001 |
6 | 133240413425351 |
7 | 12014612606431 |
oct | 1643550442243 |
9 | 387700842804 |
10 | 125051225251 |
11 | 4904117a447 |
12 | 2029b49b257 |
13 | ba3b83cc54 |
14 | 60a413dd51 |
15 | 33bd679d51 |
hex | 1d1da244a3 |
125051225251 has 4 divisors (see below), whose sum is σ = 125537806152. Its totient is φ = 124564644352.
The previous prime is 125051225213. The next prime is 125051225261. The reversal of 125051225251 is 152522150521.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 152522150521 = 13 ⋅11732473117.
It is a cyclic number.
It is not a de Polignac number, because 125051225251 - 213 = 125051217059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125051225261) 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, 243290065 + ... + 243290578.
It is an arithmetic number, because the mean of its divisors is an integer number (31384451538).
Almost surely, 2125051225251 is an apocalyptic number.
125051225251 is a deficient number, since it is larger than the sum of its proper divisors (486580901).
125051225251 is an equidigital number, since it uses as much as digits as its factorization.
125051225251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486580900.
The product of its (nonzero) digits is 10000, while the sum is 31.
Adding to 125051225251 its reverse (152522150521), we get a palindrome (277573375772).
The spelling of 125051225251 in words is "one hundred twenty-five billion, fifty-one million, two hundred twenty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •