Base | Representation |
---|---|
bin | 100011001000001101110… |
… | …100010010001011100001 |
3 | 22112202222001100011202122 |
4 | 203020031310102023201 |
5 | 304022334334230423 |
6 | 5044551115154025 |
7 | 336256153411652 |
oct | 43101564221341 |
9 | 8482861304678 |
10 | 2414003430113 |
11 | 850856004520 |
12 | 32ba24a45915 |
13 | 146841112922 |
14 | 84ba477d529 |
15 | 42bd8e858c8 |
hex | 2320dd122e1 |
2414003430113 has 8 divisors (see below), whose sum is σ = 2704632836160. Its totient is φ = 2135236448880.
The previous prime is 2414003430101. The next prime is 2414003430149. The reversal of 2414003430113 is 3110343004142.
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 2414003430113 - 226 = 2413936321249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2414003430173) 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 7 ways as a sum of consecutive naturals, for example, 2965605773 + ... + 2965606586.
It is an arithmetic number, because the mean of its divisors is an integer number (338079104520).
Almost surely, 22414003430113 is an apocalyptic number.
It is an amenable number.
2414003430113 is a deficient number, since it is larger than the sum of its proper divisors (290629406047).
2414003430113 is a wasteful number, since it uses less digits than its factorization.
2414003430113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5931212407.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 2414003430113 its reverse (3110343004142), we get a palindrome (5524346434255).
The spelling of 2414003430113 in words is "two trillion, four hundred fourteen billion, three million, four hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •