Base | Representation |
---|---|
bin | 11111011111011100110010… |
… | …01110011111111010101000 |
3 | 100002012021012110022002020020 |
4 | 33233232121032133322220 |
5 | 33034044133034200300 |
6 | 403141054532000440 |
7 | 20405112460304253 |
oct | 1757563116377250 |
9 | 302167173262206 |
10 | 69250328428200 |
11 | 20079999055447 |
12 | 7925216a60120 |
13 | 2c8437c86c57a |
14 | 1315a3b6c409a |
15 | 80155ed208a0 |
hex | 3efb9939fea8 |
69250328428200 has 768 divisors, whose sum is σ = 238089142272000. Its totient is φ = 16583688576000.
The previous prime is 69250328428189. The next prime is 69250328428297. The reversal of 69250328428200 is 282482305296.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 3545652435 + ... + 3545671965.
It is an arithmetic number, because the mean of its divisors is an integer number (310011904000).
Almost surely, 269250328428200 is an apocalyptic number.
69250328428200 is a gapful number since it is divisible by the number (60) 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 69250328428200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119044571136000).
69250328428200 is an abundant number, since it is smaller than the sum of its proper divisors (168838813843800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69250328428200 is a wasteful number, since it uses less digits than its factorization.
69250328428200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19806 (or 19797 counting only the distinct ones).
The product of its (nonzero) digits is 3317760, while the sum is 51.
The spelling of 69250328428200 in words is "sixty-nine trillion, two hundred fifty billion, three hundred twenty-eight million, four hundred twenty-eight thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •