Base | Representation |
---|---|
bin | 11100001111111101110000… |
… | …000111111111010101010011 |
3 | 121021220110100111001101022201 |
4 | 130033331300013333111103 |
5 | 112241041413412122003 |
6 | 1120124100510344031 |
7 | 35112134332155103 |
oct | 3417756007772523 |
9 | 537813314041281 |
10 | 124242400114003 |
11 | 366509a6965206 |
12 | 11b270144bb017 |
13 | 5443014922612 |
14 | 229751570b203 |
15 | e56c6b116b1d |
hex | 70ff701ff553 |
124242400114003 has 4 divisors (see below), whose sum is σ = 124242425269600. Its totient is φ = 124242374958408.
The previous prime is 124242400113961. The next prime is 124242400114043. The reversal of 124242400114003 is 300411004242421.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 124242400114003 - 217 = 124242399982931 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (124242400114043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2452203 + ... + 15952996.
It is an arithmetic number, because the mean of its divisors is an integer number (31060606317400).
Almost surely, 2124242400114003 is an apocalyptic number.
124242400114003 is a deficient number, since it is larger than the sum of its proper divisors (25155597).
124242400114003 is an equidigital number, since it uses as much as digits as its factorization.
124242400114003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25155596.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 124242400114003 its reverse (300411004242421), we get a palindrome (424653404356424).
The spelling of 124242400114003 in words is "one hundred twenty-four trillion, two hundred forty-two billion, four hundred million, one hundred fourteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •