Base | Representation |
---|---|
bin | 101110101111011010001… |
… | …000011000011010000001 |
3 | 102101001201211001022002021 |
4 | 232233122020120122001 |
5 | 410111134022402241 |
6 | 10455323355321441 |
7 | 451026234140623 |
oct | 56573210303201 |
9 | 12331654038067 |
10 | 3212000200321 |
11 | 1029224416000 |
12 | 43a610450281 |
13 | 1a3b76053b13 |
14 | b1666a48c13 |
15 | 588414780d1 |
hex | 2ebda218681 |
3212000200321 has 8 divisors (see below), whose sum is σ = 3532958899488. Its totient is φ = 2920000180900.
The previous prime is 3212000200303. The next prime is 3212000200333. The reversal of 3212000200321 is 1230020002123.
It is not a de Polignac number, because 3212000200321 - 217 = 3212000069249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3212000200295 and 3212000200304.
It is not an unprimeable number, because it can be changed into a prime (3212000200361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1206610315 + ... + 1206612976.
It is an arithmetic number, because the mean of its divisors is an integer number (441619862436).
Almost surely, 23212000200321 is an apocalyptic number.
It is an amenable number.
3212000200321 is a deficient number, since it is larger than the sum of its proper divisors (320958699167).
3212000200321 is an equidigital number, since it uses as much as digits as its factorization.
3212000200321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2413223324 (or 2413223302 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 3212000200321 its reverse (1230020002123), we get a palindrome (4442020202444).
The spelling of 3212000200321 in words is "three trillion, two hundred twelve billion, two hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •