Base | Representation |
---|---|
bin | 111111100011101010… |
… | …000111010101011000 |
3 | 20112011001002020221110 |
4 | 333203222013111120 |
5 | 2104230424240220 |
6 | 51203441140320 |
7 | 4634102144463 |
oct | 774352072530 |
9 | 215131066843 |
10 | 68243977560 |
11 | 26a3aa45460 |
12 | 1128692a6a0 |
13 | 65876b4715 |
14 | 343570a2da |
15 | 1b96392be0 |
hex | fe3a87558 |
68243977560 has 128 divisors (see below), whose sum is σ = 223442323200. Its totient is φ = 16536706560.
The previous prime is 68243977553. The next prime is 68243977573. The reversal of 68243977560 is 6577934286.
It is a self number, because there is not a number n which added to its sum of digits gives 68243977560.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3365131 + ... + 3385349.
It is an arithmetic number, because the mean of its divisors is an integer number (1745643150).
Almost surely, 268243977560 is an apocalyptic number.
68243977560 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 68243977560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111721161600).
68243977560 is an abundant number, since it is smaller than the sum of its proper divisors (155198345640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68243977560 is a wasteful number, since it uses less digits than its factorization.
68243977560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22801 (or 22797 counting only the distinct ones).
The product of its (nonzero) digits is 15240960, while the sum is 57.
The spelling of 68243977560 in words is "sixty-eight billion, two hundred forty-three million, nine hundred seventy-seven thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •