Base | Representation |
---|---|
bin | 110000011001101100101… |
… | …001000110010001000000 |
3 | 102202222022112111202001201 |
4 | 300121230221012101000 |
5 | 413443402103300000 |
6 | 11024000221310544 |
7 | 462206352263326 |
oct | 60315451062100 |
9 | 12688275452051 |
10 | 3326127400000 |
11 | 107266a229339 |
12 | 458761405454 |
13 | 1b186361a3c2 |
14 | b6db2013d16 |
15 | 5b7c0a6e96a |
hex | 3066ca46440 |
3326127400000 has 336 divisors, whose sum is σ = 8470516602240. Its totient is φ = 1295078400000.
The previous prime is 3326127399983. The next prime is 3326127400007. The reversal of 3326127400000 is 47216233.
It is a super-2 number, since 2×33261274000002 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3326127400007) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3775399560 + ... + 3775400440.
It is an arithmetic number, because the mean of its divisors is an integer number (25209870840).
Almost surely, 23326127400000 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 3326127400000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4235258301120).
3326127400000 is an abundant number, since it is smaller than the sum of its proper divisors (5144389202240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3326127400000 is an frugal number, since it uses more digits than its factorization.
3326127400000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1400 (or 1370 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 28.
The spelling of 3326127400000 in words is "three trillion, three hundred twenty-six billion, one hundred twenty-seven million, four hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •