Base | Representation |
---|---|
bin | 101101001001111001011… |
… | …110000100101001100101 |
3 | 101222122101201001121000121 |
4 | 231021321132010221211 |
5 | 401314423101023323 |
6 | 10333300035241541 |
7 | 440120224324126 |
oct | 55117136045145 |
9 | 11878351047017 |
10 | 3103004314213 |
11 | a96a82049591 |
12 | 421471a492b1 |
13 | 1967c58a475b |
14 | aa286d6404d |
15 | 55ab25c5a5d |
hex | 2d279784a65 |
3103004314213 has 2 divisors, whose sum is σ = 3103004314214. Its totient is φ = 3103004314212.
The previous prime is 3103004314159. The next prime is 3103004314237. The reversal of 3103004314213 is 3124134003013.
3103004314213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2953836880929 + 149167433284 = 1718673^2 + 386222^2 .
It is a cyclic number.
It is not a de Polignac number, because 3103004314213 - 29 = 3103004313701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3103004314913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1551502157106 + 1551502157107.
It is an arithmetic number, because the mean of its divisors is an integer number (1551502157107).
Almost surely, 23103004314213 is an apocalyptic number.
It is an amenable number.
3103004314213 is a deficient number, since it is larger than the sum of its proper divisors (1).
3103004314213 is an equidigital number, since it uses as much as digits as its factorization.
3103004314213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 3103004314213 its reverse (3124134003013), we get a palindrome (6227138317226).
The spelling of 3103004314213 in words is "three trillion, one hundred three billion, four million, three hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •