Base | Representation |
---|---|
bin | 100000000110111010… |
… | …0010000111000000000 |
3 | 20120222100000000001210 |
4 | 1000031310100320000 |
5 | 2112203011444102 |
6 | 51401545130120 |
7 | 4660451135205 |
oct | 1001564207000 |
9 | 216870000053 |
10 | 68951281152 |
11 | 27273223086 |
12 | 11443789940 |
13 | 666b0b0260 |
14 | 34a1625cac |
15 | 1bd850936c |
hex | 100dd10e00 |
68951281152 has 320 divisors, whose sum is σ = 201947074560. Its totient is φ = 20779008000.
The previous prime is 68951281127. The next prime is 68951281159. The reversal of 68951281152 is 25118215986.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68951281159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 361001377 + ... + 361001567.
It is an arithmetic number, because the mean of its divisors is an integer number (631084608).
Almost surely, 268951281152 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 68951281152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100973537280).
68951281152 is an abundant number, since it is smaller than the sum of its proper divisors (132995793408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68951281152 is a wasteful number, since it uses less digits than its factorization.
68951281152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505 (or 489 counting only the distinct ones).
The product of its digits is 345600, while the sum is 48.
The spelling of 68951281152 in words is "sixty-eight billion, nine hundred fifty-one million, two hundred eighty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •