Base | Representation |
---|---|
bin | 1001011001111001101… |
… | …00111010111101000001 |
3 | 1010220002101122221022201 |
4 | 10230330310322331001 |
5 | 20243244110144441 |
6 | 404241101033201 |
7 | 32226533426410 |
oct | 4547464727501 |
9 | 1126071587281 |
10 | 323143053121 |
11 | 115053913689 |
12 | 52763b55801 |
13 | 2461a726995 |
14 | 118d6a2b477 |
15 | 8614329c31 |
hex | 4b3cd3af41 |
323143053121 has 8 divisors (see below), whose sum is σ = 378313818624. Its totient is φ = 270224155680.
The previous prime is 323143053091. The next prime is 323143053131. The reversal of 323143053121 is 121350341323.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 323143053121 - 27 = 323143052993 is a prime.
It is a super-2 number, since 2×3231430531212 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 323143053121.
It is not an unprimeable number, because it can be changed into a prime (323143053131) 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, 562966705 + ... + 562967278.
It is an arithmetic number, because the mean of its divisors is an integer number (47289227328).
Almost surely, 2323143053121 is an apocalyptic number.
It is an amenable number.
323143053121 is a deficient number, since it is larger than the sum of its proper divisors (55170765503).
323143053121 is a wasteful number, since it uses less digits than its factorization.
323143053121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125934031.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 323143053121 its reverse (121350341323), we get a palindrome (444493394444).
The spelling of 323143053121 in words is "three hundred twenty-three billion, one hundred forty-three million, fifty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •