Base | Representation |
---|---|
bin | 111110011011010010… |
… | …010110100011010000 |
3 | 20102000102101002012100 |
4 | 332123102112203100 |
5 | 2044234111221010 |
6 | 50443145000400 |
7 | 4562026543005 |
oct | 763322264320 |
9 | 212012332170 |
10 | 67029788880 |
11 | 2647762853a |
12 | 10ba8183100 |
13 | 6422c92c92 |
14 | 335c3658ac |
15 | 1b249a32c0 |
hex | f9b4968d0 |
67029788880 has 120 divisors (see below), whose sum is σ = 225270010368. Its totient is φ = 17861776128.
The previous prime is 67029788831. The next prime is 67029788893. The reversal of 67029788880 is 8888792076.
67029788880 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (120).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 991849 + ... + 1057271.
Almost surely, 267029788880 is an apocalyptic number.
67029788880 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 67029788880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112635005184).
67029788880 is an abundant number, since it is smaller than the sum of its proper divisors (158240221488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67029788880 is a wasteful number, since it uses less digits than its factorization.
67029788880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66865 (or 66856 counting only the distinct ones).
The product of its (nonzero) digits is 21676032, while the sum is 63.
The spelling of 67029788880 in words is "sixty-seven billion, twenty-nine million, seven hundred eighty-eight thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •