Base | Representation |
---|---|
bin | 100011010001100010010… |
… | …101110010010010001111 |
3 | 22120201210112011101221001 |
4 | 203101202111302102033 |
5 | 304203333411324403 |
6 | 5053324145321131 |
7 | 340062156135151 |
oct | 43214225622217 |
9 | 8521715141831 |
10 | 2424011433103 |
11 | 855021295277 |
12 | 3319586361a7 |
13 | 1477776729a0 |
14 | 854739c6ad1 |
15 | 430c28c4c1d |
hex | 2346257248f |
2424011433103 has 4 divisors (see below), whose sum is σ = 2610473851048. Its totient is φ = 2237549015160.
The previous prime is 2424011433061. The next prime is 2424011433149. The reversal of 2424011433103 is 3013341104242.
It is a happy number.
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 2424011433103 - 225 = 2423977878671 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2424011433163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 93231208953 + ... + 93231208978.
It is an arithmetic number, because the mean of its divisors is an integer number (652618462762).
Almost surely, 22424011433103 is an apocalyptic number.
2424011433103 is a deficient number, since it is larger than the sum of its proper divisors (186462417945).
2424011433103 is a wasteful number, since it uses less digits than its factorization.
2424011433103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186462417944.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 2424011433103 its reverse (3013341104242), we get a palindrome (5437352537345).
The spelling of 2424011433103 in words is "two trillion, four hundred twenty-four billion, eleven million, four hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •