Base | Representation |
---|---|
bin | 100100101111101011010100… |
… | …1101101001110001111111110 |
3 | 1120101101202201110211202001020 |
4 | 1021133112221231032033332 |
5 | 314331001204402131423 |
6 | 3103225315214325010 |
7 | 125036204121604032 |
oct | 11137265155161776 |
9 | 1511352643752036 |
10 | 323212021130238 |
11 | 93a924a2898509 |
12 | 303007a3ab9766 |
13 | 10b469bbb8a116 |
14 | 59b578c3ca1c2 |
15 | 27577469044e3 |
hex | 125f5a9b4e3fe |
323212021130238 has 8 divisors (see below), whose sum is σ = 646424042260488. Its totient is φ = 107737340376744.
The previous prime is 323212021130237. The next prime is 323212021130311. The reversal of 323212021130238 is 832031120212323.
It is a sphenic number, since it is the product of 3 distinct primes.
323212021130238 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 323212021130199 and 323212021130208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323212021130237) 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, 26934335094181 + ... + 26934335094192.
It is an arithmetic number, because the mean of its divisors is an integer number (80803005282561).
Almost surely, 2323212021130238 is an apocalyptic number.
323212021130238 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323212021130238 is a wasteful number, since it uses less digits than its factorization.
323212021130238 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53868670188378.
The product of its (nonzero) digits is 20736, while the sum is 33.
The spelling of 323212021130238 in words is "three hundred twenty-three trillion, two hundred twelve billion, twenty-one million, one hundred thirty thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •