Base | Representation |
---|---|
bin | 101111000001000110111… |
… | …110101101010000010000 |
3 | 102102212210101021122211011 |
4 | 233001012332231100100 |
5 | 410414100100000000 |
6 | 10512145341100304 |
7 | 452301226661314 |
oct | 57010676552020 |
9 | 12385711248734 |
10 | 3231006250000 |
11 | 1036297883481 |
12 | 442235557694 |
13 | 1a58b482c069 |
14 | b254ad19b44 |
15 | 590a4d0a2ba |
hex | 2f046fad410 |
3231006250000 has 135 divisors (see below), whose sum is σ = 7835987687191. Its totient is φ = 1290605000000.
The previous prime is 3231006249973. The next prime is 3231006250033. The reversal of 3231006250000 is 526001323.
The square root of 3231006250000 is 1797500.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 2297200985104 + 933805264896 = 1515652^2 + 966336^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4493749641 + ... + 4493750359.
Almost surely, 23231006250000 is an apocalyptic number.
3231006250000 is the 1797500-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3231006250000
3231006250000 is an abundant number, since it is smaller than the sum of its proper divisors (4604981437191).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3231006250000 is an frugal number, since it uses more digits than its factorization.
3231006250000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1486 (or 726 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 22.
The spelling of 3231006250000 in words is "three trillion, two hundred thirty-one billion, six million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •