Base | Representation |
---|---|
bin | 11100100111001100001100… |
… | …010010010111100001001101 |
3 | 121111120001001011001000010021 |
4 | 130213030030102113201031 |
5 | 112443214122423301041 |
6 | 1123345215345542141 |
7 | 35335346113332523 |
oct | 3447141422274115 |
9 | 544501034030107 |
10 | 125838452947021 |
11 | 371068740a5721 |
12 | 12144403344951 |
13 | 552a690b64999 |
14 | 2310883ab8313 |
15 | e83530e0ecd1 |
hex | 72730c49784d |
125838452947021 has 2 divisors, whose sum is σ = 125838452947022. Its totient is φ = 125838452947020.
The previous prime is 125838452947007. The next prime is 125838452947091. The reversal of 125838452947021 is 120749254838521.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 125765234540100 + 73218406921 = 11214510^2 + 270589^2 .
It is a cyclic number.
It is not a de Polignac number, because 125838452947021 - 227 = 125838318729293 is a prime.
It is a super-3 number, since 3×1258384529470213 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125838452947001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62919226473510 + 62919226473511.
It is an arithmetic number, because the mean of its divisors is an integer number (62919226473511).
Almost surely, 2125838452947021 is an apocalyptic number.
It is an amenable number.
125838452947021 is a deficient number, since it is larger than the sum of its proper divisors (1).
125838452947021 is an equidigital number, since it uses as much as digits as its factorization.
125838452947021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38707200, while the sum is 61.
The spelling of 125838452947021 in words is "one hundred twenty-five trillion, eight hundred thirty-eight billion, four hundred fifty-two million, nine hundred forty-seven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •