Base | Representation |
---|---|
bin | 111010000011001111… |
… | …1100111111110111001 |
3 | 102220202222102210222112 |
4 | 1310012133213332321 |
5 | 4020302212130423 |
6 | 133134104502105 |
7 | 12002160026333 |
oct | 1640637477671 |
9 | 386688383875 |
10 | 124663005113 |
11 | 4896201a959 |
12 | 201b147a935 |
13 | b9a92943aa |
14 | 6068764453 |
15 | 3399541a78 |
hex | 1d067e7fb9 |
124663005113 has 4 divisors (see below), whose sum is σ = 124932256128. Its totient is φ = 124393754100.
The previous prime is 124663005101. The next prime is 124663005121. The reversal of 124663005113 is 311500366421.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 311500366421 = 6983 ⋅44608387.
It is a cyclic number.
It is not a de Polignac number, because 124663005113 - 214 = 124662988729 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 124663005113.
It is not an unprimeable number, because it can be changed into a prime (124663005013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 134624813 + ... + 134625738.
It is an arithmetic number, because the mean of its divisors is an integer number (31233064032).
Almost surely, 2124663005113 is an apocalyptic number.
It is an amenable number.
124663005113 is a deficient number, since it is larger than the sum of its proper divisors (269251015).
124663005113 is an equidigital number, since it uses as much as digits as its factorization.
124663005113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 269251014.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 124663005113 in words is "one hundred twenty-four billion, six hundred sixty-three million, five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •