Base | Representation |
---|---|
bin | 100000000000111110… |
… | …1000010000000000000 |
3 | 20120110110111022200002 |
4 | 1000001331002000000 |
5 | 2111301034043203 |
6 | 51330115215132 |
7 | 4652513336042 |
oct | 1000175020000 |
9 | 216413438602 |
10 | 68752252928 |
11 | 27180944247 |
12 | 113a8ba74a8 |
13 | 6638aa6388 |
14 | 3483017a92 |
15 | 1bc5ce2d88 |
hex | 1001f42000 |
68752252928 has 42 divisors (see below), whose sum is σ = 137543591181. Its totient is φ = 34364260352.
The previous prime is 68752252927. The next prime is 68752252939. The reversal of 68752252928 is 82925225786.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 56165208064 + 12587044864 = 236992^2 + 112192^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=185408.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (68752252927) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 23730776 + ... + 23733672.
Almost surely, 268752252928 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 68752252928
68752252928 is an abundant number, since it is smaller than the sum of its proper divisors (68791338253).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68752252928 is an frugal number, since it uses more digits than its factorization.
68752252928 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5820 (or 2899 counting only the distinct ones).
The product of its digits is 9676800, while the sum is 56.
The spelling of 68752252928 in words is "sixty-eight billion, seven hundred fifty-two million, two hundred fifty-two thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •