Base | Representation |
---|---|
bin | 111001111111101001… |
… | …0111001111000011001 |
3 | 102220110120011210201201 |
4 | 1303333102321320121 |
5 | 4020030302330131 |
6 | 133114112114201 |
7 | 11666162326405 |
oct | 1637722717031 |
9 | 386416153651 |
10 | 124542230041 |
11 | 488aa929849 |
12 | 20178b35961 |
13 | b98a258758 |
14 | 60566c6105 |
15 | 338db36761 |
hex | 1cff4b9e19 |
124542230041 has 8 divisors (see below), whose sum is σ = 132409131840. Its totient is φ = 116879663472.
The previous prime is 124542229991. The next prime is 124542230051. The reversal of 124542230041 is 140032245421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 124542230041 - 225 = 124508675609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 124542229991 and 124542230009.
It is not an unprimeable number, because it can be changed into a prime (124542230051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51082551 + ... + 51084988.
It is an arithmetic number, because the mean of its divisors is an integer number (16551141480).
Almost surely, 2124542230041 is an apocalyptic number.
It is an amenable number.
124542230041 is a deficient number, since it is larger than the sum of its proper divisors (7866901799).
124542230041 is a wasteful number, since it uses less digits than its factorization.
124542230041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102167615.
The product of its (nonzero) digits is 7680, while the sum is 28.
Adding to 124542230041 its reverse (140032245421), we get a palindrome (264574475462).
The spelling of 124542230041 in words is "one hundred twenty-four billion, five hundred forty-two million, two hundred thirty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •