Base | Representation |
---|---|
bin | 111010001101111010… |
… | …1101100101011101101 |
3 | 102221200221021120202011 |
4 | 1310123311230223231 |
5 | 4022020401104234 |
6 | 133233420201221 |
7 | 12014065633006 |
oct | 1643365545355 |
9 | 387627246664 |
10 | 125021113069 |
11 | 49026182746 |
12 | 20291399211 |
13 | ba35528ba8 |
14 | 60a01421ad |
15 | 33babccb64 |
hex | 1d1bd6caed |
125021113069 has 2 divisors, whose sum is σ = 125021113070. Its totient is φ = 125021113068.
The previous prime is 125021113043. The next prime is 125021113073. The reversal of 125021113069 is 960311120521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121295475625 + 3725637444 = 348275^2 + 61038^2 .
It is a cyclic number.
It is not a de Polignac number, because 125021113069 - 225 = 124987558637 is a prime.
It is a super-2 number, since 2×1250211130692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 125021113069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125021113769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62510556534 + 62510556535.
It is an arithmetic number, because the mean of its divisors is an integer number (62510556535).
Almost surely, 2125021113069 is an apocalyptic number.
It is an amenable number.
125021113069 is a deficient number, since it is larger than the sum of its proper divisors (1).
125021113069 is an equidigital number, since it uses as much as digits as its factorization.
125021113069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 31.
The spelling of 125021113069 in words is "one hundred twenty-five billion, twenty-one million, one hundred thirteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •