Base | Representation |
---|---|
bin | 111001110101110000… |
… | …0000110010010010011 |
3 | 102212121102022002212122 |
4 | 1303223200012102103 |
5 | 4013340244110103 |
6 | 133021130244455 |
7 | 11655020543612 |
oct | 1635340062223 |
9 | 385542262778 |
10 | 124210144403 |
11 | 4874a42aa04 |
12 | 200a588672b |
13 | b936505587 |
14 | 602455d879 |
15 | 336e8dab38 |
hex | 1ceb806493 |
124210144403 has 4 divisors (see below), whose sum is σ = 129610585488. Its totient is φ = 118809703320.
The previous prime is 124210144367. The next prime is 124210144433. The reversal of 124210144403 is 304441012421.
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 124210144403 - 226 = 124143035539 is a prime.
It is a super-2 number, since 2×1242101444032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (124210144433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2700220508 + ... + 2700220553.
It is an arithmetic number, because the mean of its divisors is an integer number (32402646372).
Almost surely, 2124210144403 is an apocalyptic number.
124210144403 is a deficient number, since it is larger than the sum of its proper divisors (5400441085).
124210144403 is an equidigital number, since it uses as much as digits as its factorization.
124210144403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5400441084.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 124210144403 its reverse (304441012421), we get a palindrome (428651156824).
The spelling of 124210144403 in words is "one hundred twenty-four billion, two hundred ten million, one hundred forty-four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.983 sec. • engine limits •