Base | Representation |
---|---|
bin | 1001011000100101000… |
… | …01100011101101100001 |
3 | 1010211020221012110212112 |
4 | 10230102201203231201 |
5 | 20240320413142423 |
6 | 404042425205105 |
7 | 32203125055652 |
oct | 4542241435541 |
9 | 1124227173775 |
10 | 322433334113 |
11 | 11481a236250 |
12 | 525a6330795 |
13 | 245366938c7 |
14 | 1186a683529 |
15 | 85c1d87a78 |
hex | 4b12863b61 |
322433334113 has 8 divisors (see below), whose sum is σ = 352418015136. Its totient is φ = 292560746400.
The previous prime is 322433334109. The next prime is 322433334131. The reversal of 322433334113 is 311433334223.
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 322433334113 - 22 = 322433334109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 322433334113.
It is not an unprimeable number, because it can be changed into a prime (322433334413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28017308 + ... + 28028813.
It is an arithmetic number, because the mean of its divisors is an integer number (44052251892).
Almost surely, 2322433334113 is an apocalyptic number.
It is an amenable number.
322433334113 is a deficient number, since it is larger than the sum of its proper divisors (29984681023).
322433334113 is a wasteful number, since it uses less digits than its factorization.
322433334113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56046655.
The product of its digits is 46656, while the sum is 32.
Adding to 322433334113 its reverse (311433334223), we get a palindrome (633866668336).
The spelling of 322433334113 in words is "three hundred twenty-two billion, four hundred thirty-three million, three hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •