Base | Representation |
---|---|
bin | 11100000101110001111100… |
… | …010100011110100011011101 |
3 | 121012102112211222122010122011 |
4 | 130011301330110132203131 |
5 | 112143110042402414312 |
6 | 1114430352534551221 |
7 | 35010436640220544 |
oct | 3405617424364335 |
9 | 535375758563564 |
10 | 123542525044957 |
11 | 364010aa706037 |
12 | 11a33451808511 |
13 | 53c2019317b25 |
14 | 22716c0c4715b |
15 | e43957edada7 |
hex | 705c7c51e8dd |
123542525044957 has 2 divisors, whose sum is σ = 123542525044958. Its totient is φ = 123542525044956.
The previous prime is 123542525044931. The next prime is 123542525045021. The reversal of 123542525044957 is 759440525245321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93193653386596 + 30348871658361 = 9653686^2 + 5508981^2 .
It is a cyclic number.
It is not a de Polignac number, because 123542525044957 - 243 = 114746432022749 is a prime.
It is a super-2 number, since 2×1235425250449572 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123542625044957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61771262522478 + 61771262522479.
It is an arithmetic number, because the mean of its divisors is an integer number (61771262522479).
Almost surely, 2123542525044957 is an apocalyptic number.
It is an amenable number.
123542525044957 is a deficient number, since it is larger than the sum of its proper divisors (1).
123542525044957 is an equidigital number, since it uses as much as digits as its factorization.
123542525044957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480000, while the sum is 58.
The spelling of 123542525044957 in words is "one hundred twenty-three trillion, five hundred forty-two billion, five hundred twenty-five million, forty-four thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •