Base | Representation |
---|---|
bin | 101110111111110101101… |
… | …001011000001001000000 |
3 | 102102202021021122112121102 |
4 | 232333311221120021000 |
5 | 410403301234012000 |
6 | 10511402114113532 |
7 | 452222350351145 |
oct | 56776551301100 |
9 | 12382237575542 |
10 | 3229641704000 |
11 | 10357575aa908 |
12 | 441b1457b8a8 |
13 | 1a5727c14baa |
14 | b245b9d63cc |
15 | 5902511a3d5 |
hex | 2eff5a58240 |
3229641704000 has 112 divisors (see below), whose sum is σ = 8000020220400. Its totient is φ = 1291563929600.
The previous prime is 3229641703901. The next prime is 3229641704011. The reversal of 3229641704000 is 4071469223.
3229641704000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 60130886656 + 3169510817344 = 245216^2 + 1780312^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37148582 + ... + 37235418.
Almost surely, 23229641704000 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 3229641704000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4000010110200).
3229641704000 is an abundant number, since it is smaller than the sum of its proper divisors (4770378516400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3229641704000 is an equidigital number, since it uses as much as digits as its factorization.
3229641704000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91513 (or 91493 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 38.
The spelling of 3229641704000 in words is "three trillion, two hundred twenty-nine billion, six hundred forty-one million, seven hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •