Base | Representation |
---|---|
bin | 111001110011110000… |
… | …0110001111000101011 |
3 | 102212102202100200210101 |
4 | 1303213200301320223 |
5 | 4013221130322443 |
6 | 133010335530231 |
7 | 11653245623605 |
oct | 1634740617053 |
9 | 385382320711 |
10 | 124143214123 |
11 | 48715676225 |
12 | 20087389977 |
13 | b9256a0066 |
14 | 60196da175 |
15 | 3368ab984d |
hex | 1ce7831e2b |
124143214123 has 8 divisors (see below), whose sum is σ = 128692137600. Its totient is φ = 119612165568.
The previous prime is 124143214103. The next prime is 124143214171. The reversal of 124143214123 is 321412341421.
It is a happy number.
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 124143214123 - 213 = 124143205931 is a prime.
It is a super-2 number, since 2×1241432141232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 124143214091 and 124143214100.
It is not an unprimeable number, because it can be changed into a prime (124143214103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4454586 + ... + 4482367.
It is an arithmetic number, because the mean of its divisors is an integer number (16086517200).
Almost surely, 2124143214123 is an apocalyptic number.
124143214123 is a deficient number, since it is larger than the sum of its proper divisors (4548923477).
124143214123 is an equidigital number, since it uses as much as digits as its factorization.
124143214123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8937461.
The product of its digits is 4608, while the sum is 28.
Adding to 124143214123 its reverse (321412341421), we get a palindrome (445555555544).
The spelling of 124143214123 in words is "one hundred twenty-four billion, one hundred forty-three million, two hundred fourteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •