Base | Representation |
---|---|
bin | 101110101111100110110… |
… | …000110101100111011001 |
3 | 102101002021120211120010022 |
4 | 232233212300311213121 |
5 | 410112102301213223 |
6 | 10455400410000225 |
7 | 451034416422302 |
oct | 56574660654731 |
9 | 12332246746108 |
10 | 3212212132313 |
11 | 1029323008708 |
12 | 43a66b416075 |
13 | 1a3baac28172 |
14 | b1686c557a9 |
15 | 58854d8cac8 |
hex | 2ebe6c359d9 |
3212212132313 has 4 divisors (see below), whose sum is σ = 3322978067940. Its totient is φ = 3101446196688.
The previous prime is 3212212132289. The next prime is 3212212132333. The reversal of 3212212132313 is 3132312122123.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1759435114969 + 1452777017344 = 1326437^2 + 1205312^2 .
It is a cyclic number.
It is not a de Polignac number, because 3212212132313 - 214 = 3212212115929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3212212132333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55382967770 + ... + 55382967827.
It is an arithmetic number, because the mean of its divisors is an integer number (830744516985).
Almost surely, 23212212132313 is an apocalyptic number.
It is an amenable number.
3212212132313 is a deficient number, since it is larger than the sum of its proper divisors (110765935627).
3212212132313 is a wasteful number, since it uses less digits than its factorization.
3212212132313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110765935626.
The product of its digits is 2592, while the sum is 26.
Adding to 3212212132313 its reverse (3132312122123), we get a palindrome (6344524254436).
The spelling of 3212212132313 in words is "three trillion, two hundred twelve billion, two hundred twelve million, one hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •