Base | Representation |
---|---|
bin | 1001011010000001111… |
… | …11110000000110110101 |
3 | 1010220021021021122222010 |
4 | 10231000333300012311 |
5 | 20243420012014031 |
6 | 404252040154433 |
7 | 32231343115452 |
oct | 4550077600665 |
9 | 1126237248863 |
10 | 323213001141 |
11 | 11508a349668 |
12 | 52783468a19 |
13 | 2462c077944 |
14 | 11902038829 |
15 | 861a545246 |
hex | 4b40ff01b5 |
323213001141 has 8 divisors (see below), whose sum is σ = 430962658560. Its totient is φ = 215469338912.
The previous prime is 323213001131. The next prime is 323213001173. The reversal of 323213001141 is 141100312323.
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 323213001141 - 217 = 323212870069 is a prime.
It is a super-3 number, since 3×3232130011413 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323213001131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1371456 + ... + 1589753.
It is an arithmetic number, because the mean of its divisors is an integer number (53870332320).
Almost surely, 2323213001141 is an apocalyptic number.
It is an amenable number.
323213001141 is a deficient number, since it is larger than the sum of its proper divisors (107749657419).
323213001141 is a wasteful number, since it uses less digits than its factorization.
323213001141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2997595.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 323213001141 its reverse (141100312323), we get a palindrome (464313313464).
The spelling of 323213001141 in words is "three hundred twenty-three billion, two hundred thirteen million, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •