Base | Representation |
---|---|
bin | 100100101111101011011011… |
… | …0001010110011101001101001 |
3 | 1120101101210021001021012120122 |
4 | 1021133112312022303221221 |
5 | 314331002121413242301 |
6 | 3103225352043533025 |
7 | 125036212241015321 |
oct | 11137266612635151 |
9 | 1511353231235518 |
10 | 323212230212201 |
11 | 93a9259a913920 |
12 | 30300841b2a175 |
13 | 10b46a232a4165 |
14 | 59b57ac094281 |
15 | 2757759e5481b |
hex | 125f5b62b3a69 |
323212230212201 has 32 divisors (see below), whose sum is σ = 365596496179200. Its totient is φ = 283181388497280.
The previous prime is 323212230212191. The next prime is 323212230212213. The reversal of 323212230212201 is 102212032212323.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-323212230212201 is a prime.
It is a super-2 number, since 2×3232122302122012 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (323212230211201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55481045 + ... + 61029261.
It is an arithmetic number, because the mean of its divisors is an integer number (11424890505600).
Almost surely, 2323212230212201 is an apocalyptic number.
It is an amenable number.
323212230212201 is a deficient number, since it is larger than the sum of its proper divisors (42384265966999).
323212230212201 is a wasteful number, since it uses less digits than its factorization.
323212230212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5549909.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 323212230212201 its reverse (102212032212323), we get a palindrome (425424262424524).
The spelling of 323212230212201 in words is "three hundred twenty-three trillion, two hundred twelve billion, two hundred thirty million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •