Base | Representation |
---|---|
bin | 101101001010001100010… |
… | …110111011110011111101 |
3 | 101222200012210100120110122 |
4 | 231022030112323303331 |
5 | 401321100212210414 |
6 | 10333351315344325 |
7 | 440131123023641 |
oct | 55121426736375 |
9 | 11880183316418 |
10 | 3103321210109 |
11 | a97124a1311a |
12 | 42153bbb20a5 |
13 | 196846439b13 |
14 | aa2b7094c21 |
15 | 55ad0320b8e |
hex | 2d28c5bbcfd |
3103321210109 has 8 divisors (see below), whose sum is σ = 3297994501248. Its totient is φ = 2909995139520.
The previous prime is 3103321210081. The next prime is 3103321210147. The reversal of 3103321210109 is 9010121233013.
3103321210109 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 3103321210109 - 28 = 3103321209853 is a prime.
It is a super-2 number, since 2×31033212101092 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3103321210159) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 336800387 + ... + 336809600.
It is an arithmetic number, because the mean of its divisors is an integer number (412249312656).
Almost surely, 23103321210109 is an apocalyptic number.
It is an amenable number.
3103321210109 is a deficient number, since it is larger than the sum of its proper divisors (194673291139).
3103321210109 is a wasteful number, since it uses less digits than its factorization.
3103321210109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673610275.
The product of its (nonzero) digits is 972, while the sum is 26.
The spelling of 3103321210109 in words is "three trillion, one hundred three billion, three hundred twenty-one million, two hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •