Base | Representation |
---|---|
bin | 111010001110010001… |
… | …1000110100011101101 |
3 | 102221201202200021212011 |
4 | 1310130203012203231 |
5 | 4022031422444113 |
6 | 133234523241221 |
7 | 12014302045036 |
oct | 1643443064355 |
9 | 387652607764 |
10 | 125033015533 |
11 | 49031972198 |
12 | 20295379211 |
13 | ba37b3567a |
14 | 60a195da8d |
15 | 33bbc7e63d |
hex | 1d1c8c68ed |
125033015533 has 2 divisors, whose sum is σ = 125033015534. Its totient is φ = 125033015532.
The previous prime is 125033015509. The next prime is 125033015557. The reversal of 125033015533 is 335510330521.
It is a balanced prime because it is at equal distance from previous prime (125033015509) and next prime (125033015557).
It can be written as a sum of positive squares in only one way, i.e., 109072988644 + 15960026889 = 330262^2 + 126333^2 .
It is a cyclic number.
It is not a de Polignac number, because 125033015533 - 217 = 125032884461 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125033015495 and 125033015504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125033015563) 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 as a sum of consecutive naturals, namely, 62516507766 + 62516507767.
It is an arithmetic number, because the mean of its divisors is an integer number (62516507767).
Almost surely, 2125033015533 is an apocalyptic number.
It is an amenable number.
125033015533 is a deficient number, since it is larger than the sum of its proper divisors (1).
125033015533 is an equidigital number, since it uses as much as digits as its factorization.
125033015533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20250, while the sum is 31.
The spelling of 125033015533 in words is "one hundred twenty-five billion, thirty-three million, fifteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •