Base | Representation |
---|---|
bin | 1011100011110101… |
… | …1001100011101101 |
3 | 22000021000222100122 |
4 | 2320331121203231 |
5 | 22323343300323 |
6 | 1231530134325 |
7 | 136616641100 |
oct | 27075314355 |
9 | 8007028318 |
10 | 3103103213 |
11 | 1352691411 |
12 | 7272813a5 |
13 | 3a5b73662 |
14 | 2161a4737 |
15 | 13265cec8 |
hex | b8f598ed |
3103103213 has 24 divisors (see below), whose sum is σ = 3854334528. Its totient is φ = 2484953856.
The previous prime is 3103103197. The next prime is 3103103219. The reversal of 3103103213 is 3123013013.
It is not a de Polignac number, because 3103103213 - 24 = 3103103197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3103103191 and 3103103200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3103103219) 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 23 ways as a sum of consecutive naturals, for example, 16445 + ... + 80477.
It is an arithmetic number, because the mean of its divisors is an integer number (160597272).
Almost surely, 23103103213 is an apocalyptic number.
It is an amenable number.
3103103213 is a deficient number, since it is larger than the sum of its proper divisors (751231315).
3103103213 is a wasteful number, since it uses less digits than its factorization.
3103103213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64113 (or 64106 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 3103103213 is about 55705.5043330549. The cubic root of 3103103213 is about 1458.5861105651.
Adding to 3103103213 its reverse (3123013013), we get a palindrome (6226116226).
The spelling of 3103103213 in words is "three billion, one hundred three million, one hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •