Base | Representation |
---|---|
bin | 11100011110011101101111… |
… | …010110011111010100100101 |
3 | 121102102201021200000100001201 |
4 | 130132131233112133110211 |
5 | 112403403100301104001 |
6 | 1122205530333122501 |
7 | 35244130461503356 |
oct | 3436355726372445 |
9 | 542381250010051 |
10 | 125238819550501 |
11 | 369a5537737808 |
12 | 12068157329431 |
13 | 54b5c7c154b17 |
14 | 22cd83c3c3d2d |
15 | e72b3835a501 |
hex | 71e76f59f525 |
125238819550501 has 2 divisors, whose sum is σ = 125238819550502. Its totient is φ = 125238819550500.
The previous prime is 125238819550477. The next prime is 125238819550511. The reversal of 125238819550501 is 105055918832521.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125152862106276 + 85957444225 = 11187174^2 + 293185^2 .
It is a cyclic number.
It is not a de Polignac number, because 125238819550501 - 25 = 125238819550469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125238819550511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62619409775250 + 62619409775251.
It is an arithmetic number, because the mean of its divisors is an integer number (62619409775251).
Almost surely, 2125238819550501 is an apocalyptic number.
It is an amenable number.
125238819550501 is a deficient number, since it is larger than the sum of its proper divisors (1).
125238819550501 is an equidigital number, since it uses as much as digits as its factorization.
125238819550501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320000, while the sum is 55.
The spelling of 125238819550501 in words is "one hundred twenty-five trillion, two hundred thirty-eight billion, eight hundred nineteen million, five hundred fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •