Base | Representation |
---|---|
bin | 111001111100000010… |
… | …1101011010110011111 |
3 | 102220011010200001021102 |
4 | 1303320011223112133 |
5 | 4014303324302033 |
6 | 133054112423315 |
7 | 11663163534266 |
oct | 1637005532637 |
9 | 386133601242 |
10 | 124421322143 |
11 | 48848657968 |
12 | 20144547b3b |
13 | b96b1a4511 |
14 | 60446115dd |
15 | 3383201de8 |
hex | 1cf816b59f |
124421322143 has 4 divisors (see below), whose sum is σ = 124639989360. Its totient is φ = 124202654928.
The previous prime is 124421322139. The next prime is 124421322149. The reversal of 124421322143 is 341223124421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341223124421 = 64577 ⋅5283973.
It is a cyclic number.
It is not a de Polignac number, because 124421322143 - 22 = 124421322139 is a prime.
It is a super-2 number, since 2×1244213221432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124421322149) 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, 109332755 + ... + 109333892.
It is an arithmetic number, because the mean of its divisors is an integer number (31159997340).
Almost surely, 2124421322143 is an apocalyptic number.
124421322143 is a deficient number, since it is larger than the sum of its proper divisors (218667217).
124421322143 is an equidigital number, since it uses as much as digits as its factorization.
124421322143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 218667216.
The product of its digits is 9216, while the sum is 29.
Adding to 124421322143 its reverse (341223124421), we get a palindrome (465644446564).
The spelling of 124421322143 in words is "one hundred twenty-four billion, four hundred twenty-one million, three hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •