Base | Representation |
---|---|
bin | 101110111010101011011… |
… | …110101010011110000101 |
3 | 102102012222020111110112102 |
4 | 232322223132222132011 |
5 | 410310430204223323 |
6 | 10505044320001445 |
7 | 451635156230222 |
oct | 56725336523605 |
9 | 12365866443472 |
10 | 3224102414213 |
11 | 103337484046a |
12 | 440a29460285 |
13 | 1a5054425a25 |
14 | b2094072949 |
15 | 58cedb89328 |
hex | 2eeab7aa785 |
3224102414213 has 6 divisors (see below), whose sum is σ = 3424911561426. Its totient is φ = 3034449330752.
The previous prime is 3224102414149. The next prime is 3224102414227. The reversal of 3224102414213 is 3124142014223.
It can be written as a sum of positive squares in 3 ways, for example, as 427842885409 + 2796259528804 = 654097^2 + 1672202^2 .
It is not a de Polignac number, because 3224102414213 - 26 = 3224102414149 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 (3224102414233) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5578031570 + ... + 5578032147.
It is an arithmetic number, because the mean of its divisors is an integer number (570818593571).
Almost surely, 23224102414213 is an apocalyptic number.
It is an amenable number.
3224102414213 is a deficient number, since it is larger than the sum of its proper divisors (200809147213).
3224102414213 is a wasteful number, since it uses less digits than its factorization.
3224102414213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11156063751 (or 11156063734 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 3224102414213 its reverse (3124142014223), we get a palindrome (6348244428436).
The spelling of 3224102414213 in words is "three trillion, two hundred twenty-four billion, one hundred two million, four hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •