Base | Representation |
---|---|
bin | 1100000100110001… |
… | …0111000111011111 |
3 | 22100212222012122212 |
4 | 3001030113013133 |
5 | 23114224234403 |
6 | 1253343031035 |
7 | 143215053230 |
oct | 30114270737 |
9 | 8325865585 |
10 | 3241243103 |
11 | 1413662a0a |
12 | 76559b47b |
13 | 3c867c137 |
14 | 22a683087 |
15 | 13e8484d8 |
hex | c13171df |
3241243103 has 8 divisors (see below), whose sum is σ = 3922176672. Its totient is φ = 2614784256.
The previous prime is 3241243091. The next prime is 3241243123. The reversal of 3241243103 is 3013421423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3241243103 - 26 = 3241243039 is a prime.
It is a super-3 number, since 3×32412431033 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3241243123) 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, 13618550 + ... + 13618787.
It is an arithmetic number, because the mean of its divisors is an integer number (490272084).
Almost surely, 23241243103 is an apocalyptic number.
3241243103 is a deficient number, since it is larger than the sum of its proper divisors (680933569).
3241243103 is a wasteful number, since it uses less digits than its factorization.
3241243103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27237361.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 3241243103 is about 56931.9163826408. The cubic root of 3241243103 is about 1479.9164645753.
Adding to 3241243103 its reverse (3013421423), we get a palindrome (6254664526).
The spelling of 3241243103 in words is "three billion, two hundred forty-one million, two hundred forty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •