Base | Representation |
---|---|
bin | 11100100000111100101011… |
… | …010110010100000110101101 |
3 | 121110001000210002202120120111 |
4 | 130200330223112110012231 |
5 | 112414202102200030314 |
6 | 1122420152450020021 |
7 | 35262351521022664 |
oct | 3440745326240655 |
9 | 543030702676514 |
10 | 125409477345709 |
11 | 36a609515a8187 |
12 | 12095244277611 |
13 | 54c90a846202b |
14 | 22d7bcb569ddb |
15 | e772c57dcec4 |
hex | 720f2b5941ad |
125409477345709 has 2 divisors, whose sum is σ = 125409477345710. Its totient is φ = 125409477345708.
The previous prime is 125409477345689. The next prime is 125409477345727. The reversal of 125409477345709 is 907543774904521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111344239712484 + 14065237633225 = 10551978^2 + 3750365^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125409477345709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125409477375709) 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, 62704738672854 + 62704738672855.
It is an arithmetic number, because the mean of its divisors is an integer number (62704738672855).
Almost surely, 2125409477345709 is an apocalyptic number.
It is an amenable number.
125409477345709 is a deficient number, since it is larger than the sum of its proper divisors (1).
125409477345709 is an equidigital number, since it uses as much as digits as its factorization.
125409477345709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 266716800, while the sum is 67.
The spelling of 125409477345709 in words is "one hundred twenty-five trillion, four hundred nine billion, four hundred seventy-seven million, three hundred forty-five thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •