Base | Representation |
---|---|
bin | 111010010111100101… |
… | …0110011000001000101 |
3 | 102222112112111122001212 |
4 | 1310233022303001011 |
5 | 4023201411124031 |
6 | 133325523101205 |
7 | 12025114262306 |
oct | 1645712630105 |
9 | 388475448055 |
10 | 125345411141 |
11 | 49182242685 |
12 | 20361b11805 |
13 | ba87783542 |
14 | 60d123c7ad |
15 | 33d93db12b |
hex | 1d2f2b3045 |
125345411141 has 2 divisors, whose sum is σ = 125345411142. Its totient is φ = 125345411140.
The previous prime is 125345411089. The next prime is 125345411161. The reversal of 125345411141 is 141114543521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66136408900 + 59209002241 = 257170^2 + 243329^2 .
It is a cyclic number.
It is not a de Polignac number, because 125345411141 - 218 = 125345148997 is a prime.
It is a super-2 number, since 2×1253454111412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 125345411098 and 125345411107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125345411161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62672705570 + 62672705571.
It is an arithmetic number, because the mean of its divisors is an integer number (62672705571).
Almost surely, 2125345411141 is an apocalyptic number.
It is an amenable number.
125345411141 is a deficient number, since it is larger than the sum of its proper divisors (1).
125345411141 is an equidigital number, since it uses as much as digits as its factorization.
125345411141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9600, while the sum is 32.
Adding to 125345411141 its reverse (141114543521), we get a palindrome (266459954662).
The spelling of 125345411141 in words is "one hundred twenty-five billion, three hundred forty-five million, four hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •