Base | Representation |
---|---|
bin | 111010001110000101… |
… | …0010011110100011101 |
3 | 102221201022110002112002 |
4 | 1310130022103310131 |
5 | 4022023242010003 |
6 | 133234132052045 |
7 | 12014162565512 |
oct | 1643412236435 |
9 | 387638402462 |
10 | 125026516253 |
11 | 49029233191 |
12 | 20293164025 |
13 | ba3669b342 |
14 | 60a0b4b309 |
15 | 33bb3e8a88 |
hex | 1d1c293d1d |
125026516253 has 4 divisors (see below), whose sum is σ = 125030712288. Its totient is φ = 125022320220.
The previous prime is 125026516207. The next prime is 125026516291. The reversal of 125026516253 is 352615620521.
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, and also an emirpimes, since its reverse is a distinct semiprime: 352615620521 = 113 ⋅3120492217.
It is a cyclic number.
It is not a de Polignac number, because 125026516253 - 218 = 125026254109 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 (125026510253) 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, 2053001 + ... + 2113022.
It is an arithmetic number, because the mean of its divisors is an integer number (31257678072).
Almost surely, 2125026516253 is an apocalyptic number.
It is an amenable number.
125026516253 is a deficient number, since it is larger than the sum of its proper divisors (4196035).
125026516253 is an equidigital number, since it uses as much as digits as its factorization.
125026516253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4196034.
The product of its (nonzero) digits is 108000, while the sum is 38.
The spelling of 125026516253 in words is "one hundred twenty-five billion, twenty-six million, five hundred sixteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •