Base | Representation |
---|---|
bin | 11100011110101001011000… |
… | …000111000011110001001011 |
3 | 121102110220112110112010120011 |
4 | 130132221120013003301023 |
5 | 112404104143010001103 |
6 | 1122215354244012351 |
7 | 35245052223211204 |
oct | 3436513007036113 |
9 | 542426473463504 |
10 | 125251314531403 |
11 | 369aa869837905 |
12 | 1206a6639910b7 |
13 | 54b71c0a05048 |
14 | 22d02a5a4c5ab |
15 | e7311a2a1d6d |
hex | 71ea581c3c4b |
125251314531403 has 2 divisors, whose sum is σ = 125251314531404. Its totient is φ = 125251314531402.
The previous prime is 125251314531313. The next prime is 125251314531433. The reversal of 125251314531403 is 304135413152521.
It is a strong prime.
It is an emirp because it is prime and its reverse (304135413152521) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 125251314531403 - 221 = 125251312434251 is a prime.
It is not a weakly prime, because it can be changed into another prime (125251314531433) 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, 62625657265701 + 62625657265702.
It is an arithmetic number, because the mean of its divisors is an integer number (62625657265702).
Almost surely, 2125251314531403 is an apocalyptic number.
125251314531403 is a deficient number, since it is larger than the sum of its proper divisors (1).
125251314531403 is an equidigital number, since it uses as much as digits as its factorization.
125251314531403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 40.
Adding to 125251314531403 its reverse (304135413152521), we get a palindrome (429386727683924).
The spelling of 125251314531403 in words is "one hundred twenty-five trillion, two hundred fifty-one billion, three hundred fourteen million, five hundred thirty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •