Base | Representation |
---|---|
bin | 101101001001111001110… |
… | …100100100110101011101 |
3 | 101222122102010011021221002 |
4 | 231021321310210311131 |
5 | 401314431103310323 |
6 | 10333300405520045 |
7 | 440120325423311 |
oct | 55117164446535 |
9 | 11878363137832 |
10 | 3103010213213 |
11 | a96a85408599 |
12 | 421473a13025 |
13 | 1967c6b8b7a1 |
14 | aa287a5bb41 |
15 | 55ab2d8d828 |
hex | 2d279d24d5d |
3103010213213 has 8 divisors (see below), whose sum is σ = 3238071467136. Its totient is φ = 2967961273200.
The previous prime is 3103010213207. The next prime is 3103010213221. The reversal of 3103010213213 is 3123120103013.
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 3103010213213 - 28 = 3103010212957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3103010213203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2561678 + ... + 3573263.
It is an arithmetic number, because the mean of its divisors is an integer number (404758933392).
Almost surely, 23103010213213 is an apocalyptic number.
It is an amenable number.
3103010213213 is a deficient number, since it is larger than the sum of its proper divisors (135061253923).
3103010213213 is a wasteful number, since it uses less digits than its factorization.
3103010213213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6156955.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 3103010213213 its reverse (3123120103013), we get a palindrome (6226130316226).
The spelling of 3103010213213 in words is "three trillion, one hundred three billion, ten million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •