Base | Representation |
---|---|
bin | 101111000001010010010… |
… | …000011010001110000000 |
3 | 102102220021120021111201012 |
4 | 233001102100122032000 |
5 | 410414442013040000 |
6 | 10512220220100052 |
7 | 452306015033543 |
oct | 57012220321600 |
9 | 12386246244635 |
10 | 3231195440000 |
11 | 1036384652750 |
12 | 442288994628 |
13 | 1a5914a9cbc8 |
14 | b25680c685a |
15 | 590b672b735 |
hex | 2f05241a380 |
3231195440000 has 640 divisors, whose sum is σ = 9509272058880. Its totient is φ = 1079930880000.
The previous prime is 3231195439993. The next prime is 3231195440027. The reversal of 3231195440000 is 445911323.
It is a tau number, because it is divible by the number of its divisors (640).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 643277489 + ... + 643282511.
It is an arithmetic number, because the mean of its divisors is an integer number (14858237592).
Almost surely, 23231195440000 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 3231195440000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4754636029440).
3231195440000 is an abundant number, since it is smaller than the sum of its proper divisors (6278076618880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3231195440000 is a wasteful number, since it uses less digits than its factorization.
3231195440000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5128 (or 5101 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 3231195440000 in words is "three trillion, two hundred thirty-one billion, one hundred ninety-five million, four hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •