Base | Representation |
---|---|
bin | 100100101111101011011010… |
… | …1101011100100011000101101 |
3 | 1120101101210020110212011101210 |
4 | 1021133112311223210120231 |
5 | 314331002112314220323 |
6 | 3103225351152225033 |
7 | 125036212111300605 |
oct | 11137266553443055 |
9 | 1511353213764353 |
10 | 323212222023213 |
11 | 93a92596230366 |
12 | 3030083b23b179 |
13 | 10b46a216979c3 |
14 | 59b57aad61c05 |
15 | 2757759388293 |
hex | 125f5b5ae462d |
323212222023213 has 16 divisors (see below), whose sum is σ = 433074823345152. Its totient is φ = 214412608158000.
The previous prime is 323212222023181. The next prime is 323212222023239. The reversal of 323212222023213 is 312320222212323.
It is a happy number.
It is not a de Polignac number, because 323212222023213 - 25 = 323212222023181 is a prime.
It is a super-2 number, since 2×3232122220232132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323212222023253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45494343 + ... + 52116788.
It is an arithmetic number, because the mean of its divisors is an integer number (27067176459072).
Almost surely, 2323212222023213 is an apocalyptic number.
It is an amenable number.
323212222023213 is a deficient number, since it is larger than the sum of its proper divisors (109862601321939).
323212222023213 is a wasteful number, since it uses less digits than its factorization.
323212222023213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97616576.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 323212222023213 its reverse (312320222212323), we get a palindrome (635532444235536).
The spelling of 323212222023213 in words is "three hundred twenty-three trillion, two hundred twelve billion, two hundred twenty-two million, twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •