Base | Representation |
---|---|
bin | 111001111011011110… |
… | …0101111100110010111 |
3 | 102220002210200200210011 |
4 | 1303312330233212113 |
5 | 4014233430444111 |
6 | 133052150541051 |
7 | 11662542164401 |
oct | 1636674574627 |
9 | 386083620704 |
10 | 124402203031 |
11 | 48838889447 |
12 | 2013a067787 |
13 | b96723c032 |
14 | 6041c75b71 |
15 | 33816c7021 |
hex | 1cf6f2f997 |
124402203031 has 4 divisors (see below), whose sum is σ = 128691934200. Its totient is φ = 120112471864.
The previous prime is 124402203019. The next prime is 124402203053. The reversal of 124402203031 is 130302204421.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-124402203031 is a prime.
It is a super-2 number, since 2×1244022030312 (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 = 124402202993 and 124402203011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124402203071) 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, 2144865541 + ... + 2144865598.
It is an arithmetic number, because the mean of its divisors is an integer number (32172983550).
Almost surely, 2124402203031 is an apocalyptic number.
124402203031 is a deficient number, since it is larger than the sum of its proper divisors (4289731169).
124402203031 is an equidigital number, since it uses as much as digits as its factorization.
124402203031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4289731168.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 124402203031 its reverse (130302204421), we get a palindrome (254704407452).
The spelling of 124402203031 in words is "one hundred twenty-four billion, four hundred two million, two hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •