Base | Representation |
---|---|
bin | 1001100011001001111… |
… | …01010010010111010111 |
3 | 1011100220122022010200021 |
4 | 10301210331102113113 |
5 | 20333432443131403 |
6 | 410422055530011 |
7 | 32463622023334 |
oct | 4614475222727 |
9 | 1140818263607 |
10 | 328111302103 |
11 | 117173304682 |
12 | 5370b989907 |
13 | 24c2cb19590 |
14 | 11c487c598b |
15 | 88055ad8bd |
hex | 4c64f525d7 |
328111302103 has 4 divisors (see below), whose sum is σ = 353350633048. Its totient is φ = 302871971160.
The previous prime is 328111302091. The next prime is 328111302109. The reversal of 328111302103 is 301203111823.
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 328111302103 - 237 = 190672348631 is a prime.
It is a super-3 number, since 3×3281113021033 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (328111302109) 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, 12619665453 + ... + 12619665478.
It is an arithmetic number, because the mean of its divisors is an integer number (88337658262).
Almost surely, 2328111302103 is an apocalyptic number.
328111302103 is a deficient number, since it is larger than the sum of its proper divisors (25239330945).
328111302103 is a wasteful number, since it uses less digits than its factorization.
328111302103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25239330944.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 328111302103 its reverse (301203111823), we get a palindrome (629314413926).
The spelling of 328111302103 in words is "three hundred twenty-eight billion, one hundred eleven million, three hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •