Base | Representation |
---|---|
bin | 11100000001011010000110… |
… | …110110111000011001010101 |
3 | 121011100211021122120220100101 |
4 | 130001122012312320121111 |
5 | 112123144211324001031 |
6 | 1114040341300214101 |
7 | 34646641663436140 |
oct | 3401320666703125 |
9 | 534324248526311 |
10 | 123242054125141 |
11 | 362a5730704806 |
12 | 119a517669a331 |
13 | 539c8a2a76553 |
14 | 2260d3935d057 |
15 | e3ac1e30a361 |
hex | 701686db8655 |
123242054125141 has 8 divisors (see below), whose sum is σ = 141328771968384. Its totient is φ = 105275513809680.
The previous prime is 123242054125123. The next prime is 123242054125163. The reversal of 123242054125141 is 141521450242321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123242054125141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123242054125141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123242054125241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30044379745 + ... + 30044383846.
It is an arithmetic number, because the mean of its divisors is an integer number (17666096496048).
Almost surely, 2123242054125141 is an apocalyptic number.
It is an amenable number.
123242054125141 is a deficient number, since it is larger than the sum of its proper divisors (18086717843243).
123242054125141 is an equidigital number, since it uses as much as digits as its factorization.
123242054125141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60088763891.
The product of its (nonzero) digits is 76800, while the sum is 37.
The spelling of 123242054125141 in words is "one hundred twenty-three trillion, two hundred forty-two billion, fifty-four million, one hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •