Base | Representation |
---|---|
bin | 1000100111111101010… |
… | …00000011111101111000 |
3 | 1001022212201121000022202 |
4 | 10103332220003331320 |
5 | 14323340400103000 |
6 | 344044301405332 |
7 | 30260216546120 |
oct | 4237650037570 |
9 | 1038781530282 |
10 | 296329691000 |
11 | 104744426882 |
12 | 49520269848 |
13 | 21c36602435 |
14 | 104b18cdc80 |
15 | 7a9535edd5 |
hex | 44fea03f78 |
296329691000 has 256 divisors, whose sum is σ = 800000997120. Its totient is φ = 100638720000.
The previous prime is 296329690997. The next prime is 296329691011. The reversal of 296329691000 is 196923692.
It is a super-2 number, since 2×2963296910002 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 568770740 + ... + 568771260.
It is an arithmetic number, because the mean of its divisors is an integer number (3125003895).
Almost surely, 2296329691000 is an apocalyptic number.
296329691000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 296329691000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (400000498560).
296329691000 is an abundant number, since it is smaller than the sum of its proper divisors (503671306120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
296329691000 is a wasteful number, since it uses less digits than its factorization.
296329691000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163 (or 1149 counting only the distinct ones).
The product of its (nonzero) digits is 314928, while the sum is 47.
The spelling of 296329691000 in words is "two hundred ninety-six billion, three hundred twenty-nine million, six hundred ninety-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •