Base | Representation |
---|---|
bin | 111111101000110110… |
… | …001100011011111000 |
3 | 20112101002212222210200 |
4 | 333220312030123320 |
5 | 2104420220432024 |
6 | 51220231042200 |
7 | 4636210113450 |
oct | 775066143370 |
9 | 215332788720 |
10 | 68331030264 |
11 | 26a850a3442 |
12 | 112abb10360 |
13 | 659c743cb3 |
14 | 34430cad60 |
15 | 1b9dd3b2c9 |
hex | fe8d8c6f8 |
68331030264 has 192 divisors, whose sum is σ = 215266222080. Its totient is φ = 19176480000.
The previous prime is 68331030263. The next prime is 68331030281. The reversal of 68331030264 is 46203013386.
68331030264 is a `hidden beast` number, since 6 + 83 + 310 + 3 + 0 + 264 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68331030263) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35385379 + ... + 35387309.
It is an arithmetic number, because the mean of its divisors is an integer number (1121178240).
Almost surely, 268331030264 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 68331030264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107633111040).
68331030264 is an abundant number, since it is smaller than the sum of its proper divisors (146935191816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68331030264 is a wasteful number, since it uses less digits than its factorization.
68331030264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3162 (or 3155 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 36.
The spelling of 68331030264 in words is "sixty-eight billion, three hundred thirty-one million, thirty thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •