Base | Representation |
---|---|
bin | 1001100110000110010… |
… | …00100011011111010000 |
3 | 1011111222202101001201011 |
4 | 10303003020203133100 |
5 | 20400201434023003 |
6 | 411242541020304 |
7 | 32551025634361 |
oct | 4630310433720 |
9 | 1144882331634 |
10 | 329691314128 |
11 | 117904174040 |
12 | 53a90b54694 |
13 | 25122274537 |
14 | 11d58595b68 |
15 | 889916046d |
hex | 4cc32237d0 |
329691314128 has 60 divisors (see below), whose sum is σ = 700381699488. Its totient is φ = 149103472320.
The previous prime is 329691314123. The next prime is 329691314129. The reversal of 329691314128 is 821413196923.
It is a super-2 number, since 2×3296913141282 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (329691314123) 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 11 ways as a sum of consecutive naturals, for example, 6946125 + ... + 6993427.
Almost surely, 2329691314128 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 329691314128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (350190849744).
329691314128 is an abundant number, since it is smaller than the sum of its proper divisors (370690385360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
329691314128 is a wasteful number, since it uses less digits than its factorization.
329691314128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47720 (or 47515 counting only the distinct ones).
The product of its digits is 559872, while the sum is 49.
The spelling of 329691314128 in words is "three hundred twenty-nine billion, six hundred ninety-one million, three hundred fourteen thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.637 sec. • engine limits •