Base | Representation |
---|---|
bin | 11100001100101001011100… |
… | …000011000111001011011011 |
3 | 121021002122220212002221001011 |
4 | 130030221130003013023123 |
5 | 112223323023041240121 |
6 | 1115431235340234351 |
7 | 35056514120320303 |
oct | 3414513403071333 |
9 | 537078825087034 |
10 | 124014430024411 |
11 | 36573251776793 |
12 | 11aaa9b183b9b7 |
13 | 5427683958994 |
14 | 228a48aa24603 |
15 | e50d773887e1 |
hex | 70ca5c0c72db |
124014430024411 has 4 divisors (see below), whose sum is σ = 124014467838024. Its totient is φ = 124014392210800.
The previous prime is 124014430024361. The next prime is 124014430024423. The reversal of 124014430024411 is 114420034410421.
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 124014430024411 - 215 = 124014429991643 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (124014430024711) 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 3 ways as a sum of consecutive naturals, for example, 13465345 + ... + 20720626.
It is an arithmetic number, because the mean of its divisors is an integer number (31003616959506).
Almost surely, 2124014430024411 is an apocalyptic number.
124014430024411 is a deficient number, since it is larger than the sum of its proper divisors (37813613).
124014430024411 is an equidigital number, since it uses as much as digits as its factorization.
124014430024411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37813612.
The product of its (nonzero) digits is 12288, while the sum is 31.
Adding to 124014430024411 its reverse (114420034410421), we get a palindrome (238434464434832).
The spelling of 124014430024411 in words is "one hundred twenty-four trillion, fourteen billion, four hundred thirty million, twenty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •