Base | Representation |
---|---|
bin | 101110110000100010011… |
… | …000001011101111101001 |
3 | 102101011212021211110102122 |
4 | 232300202120023233221 |
5 | 410121124322133223 |
6 | 10500043535041025 |
7 | 451101252631646 |
oct | 56604230135751 |
9 | 12334767743378 |
10 | 3213212302313 |
11 | 1029796638192 |
12 | 43a8aa370175 |
13 | 1a400a1c4830 |
14 | b173da08dcd |
15 | 588b2aa45c8 |
hex | 2ec2260bbe9 |
3213212302313 has 64 divisors (see below), whose sum is σ = 3591356160000. Its totient is φ = 2856717766656.
The previous prime is 3213212302277. The next prime is 3213212302331. The reversal of 3213212302313 is 3132032123123.
3213212302313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3213212302313 - 228 = 3212943866857 is a prime.
It is a super-2 number, since 2×32132123023132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3213212302213) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3496422068 + ... + 3496422986.
It is an arithmetic number, because the mean of its divisors is an integer number (56114940000).
Almost surely, 23213212302313 is an apocalyptic number.
It is an amenable number.
3213212302313 is a deficient number, since it is larger than the sum of its proper divisors (378143857687).
3213212302313 is a wasteful number, since it uses less digits than its factorization.
3213212302313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1546.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 3213212302313 its reverse (3132032123123), we get a palindrome (6345244425436).
The spelling of 3213212302313 in words is "three trillion, two hundred thirteen billion, two hundred twelve million, three hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •