Base | Representation |
---|---|
bin | 100000000110010011… |
… | …1111110010001010000 |
3 | 20120220221100221101110 |
4 | 1000030213332101100 |
5 | 2112132402011000 |
6 | 51355552333320 |
7 | 4660116141510 |
oct | 1001447762120 |
9 | 216827327343 |
10 | 68931282000 |
11 | 27262a03459 |
12 | 11438b44240 |
13 | 6666bca339 |
14 | 349cadb840 |
15 | 1bd68a8850 |
hex | 100c9fe450 |
68931282000 has 320 divisors, whose sum is σ = 256001900544. Its totient is φ = 15630451200.
The previous prime is 68931281999. The next prime is 68931282067. The reversal of 68931282000 is 28213986.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 68931282000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5327539 + ... + 5340461.
Almost surely, 268931282000 is an apocalyptic number.
68931282000 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 68931282000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128000950272).
68931282000 is an abundant number, since it is smaller than the sum of its proper divisors (187070618544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68931282000 is a wasteful number, since it uses less digits than its factorization.
68931282000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13083 (or 13067 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 39.
Adding to 68931282000 its reverse (28213986), we get a palindrome (68959495986).
The spelling of 68931282000 in words is "sixty-eight billion, nine hundred thirty-one million, two hundred eighty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •