Base | Representation |
---|---|
bin | 1001011010000001111… |
… | …00011100001100000001 |
3 | 1010220021012122120021020 |
4 | 10231000330130030001 |
5 | 20243414301224441 |
6 | 404252005420053 |
7 | 32231332542003 |
oct | 4550074341401 |
9 | 1126235576236 |
10 | 323212133121 |
11 | 115089906499 |
12 | 5278310a629 |
13 | 2462bb32817 |
14 | 11901c90373 |
15 | 861a422e66 |
hex | 4b40f1c301 |
323212133121 has 8 divisors (see below), whose sum is σ = 432799080480. Its totient is φ = 214549970592.
The previous prime is 323212133113. The next prime is 323212133129. The reversal of 323212133121 is 121331212323.
It is an interprime number because it is at equal distance from previous prime (323212133113) and next prime (323212133129).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 323212133121 - 23 = 323212133113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 323212133091 and 323212133100.
It is not an unprimeable number, because it can be changed into a prime (323212133129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 231195391 + ... + 231196788.
It is an arithmetic number, because the mean of its divisors is an integer number (54099885060).
Almost surely, 2323212133121 is an apocalyptic number.
It is an amenable number.
323212133121 is a deficient number, since it is larger than the sum of its proper divisors (109586947359).
323212133121 is a wasteful number, since it uses less digits than its factorization.
323212133121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462392415.
The product of its digits is 1296, while the sum is 24.
Adding to 323212133121 its reverse (121331212323), we get a palindrome (444543345444).
The spelling of 323212133121 in words is "three hundred twenty-three billion, two hundred twelve million, one hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •