Base | Representation |
---|---|
bin | 11100011111110100100111… |
… | …111101010001111101010101 |
3 | 121102202122002022102001102011 |
4 | 130133310213331101331111 |
5 | 112411420130411242331 |
6 | 1122320435453344221 |
7 | 35253642356206252 |
oct | 3437644775217525 |
9 | 542678068361364 |
10 | 125332111040341 |
11 | 36a3106030a937 |
12 | 12082252498071 |
13 | 54c19c8b69a0a |
14 | 22d416c4c4429 |
15 | e752986583b1 |
hex | 71fd27f51f55 |
125332111040341 has 2 divisors, whose sum is σ = 125332111040342. Its totient is φ = 125332111040340.
The previous prime is 125332111040329. The next prime is 125332111040363. The reversal of 125332111040341 is 143040111233521.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113824445673316 + 11507665367025 = 10668854^2 + 3392295^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125332111040341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125332111041341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62666055520170 + 62666055520171.
It is an arithmetic number, because the mean of its divisors is an integer number (62666055520171).
Almost surely, 2125332111040341 is an apocalyptic number.
It is an amenable number.
125332111040341 is a deficient number, since it is larger than the sum of its proper divisors (1).
125332111040341 is an equidigital number, since it uses as much as digits as its factorization.
125332111040341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 125332111040341 its reverse (143040111233521), we get a palindrome (268372222273862).
The spelling of 125332111040341 in words is "one hundred twenty-five trillion, three hundred thirty-two billion, one hundred eleven million, forty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •