Base | Representation |
---|---|
bin | 1111111110110… |
… | …1001000000000 |
3 | 11200010120000002 |
4 | 3333231020000 |
5 | 114130002202 |
6 | 10352415132 |
7 | 1442521160 |
oct | 377551000 |
9 | 150116002 |
10 | 67031552 |
11 | 34923885 |
12 | 1a5474a8 |
13 | 10b6c653 |
14 | 8c8c5a0 |
15 | 5d41302 |
hex | 3fed200 |
67031552 has 80 divisors (see below), whose sum is σ = 156150720. Its totient is φ = 28151808.
The previous prime is 67031551. The next prime is 67031623. The reversal of 67031552 is 25513076.
67031552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (67031551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 211298 + ... + 211614.
It is an arithmetic number, because the mean of its divisors is an integer number (1951884).
Almost surely, 267031552 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 67031552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78075360).
67031552 is an abundant number, since it is smaller than the sum of its proper divisors (89119168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67031552 is an equidigital number, since it uses as much as digits as its factorization.
67031552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401 (or 385 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 29.
The square root of 67031552 is about 8187.2798901711. The cubic root of 67031552 is about 406.2185562409.
The spelling of 67031552 in words is "sixty-seven million, thirty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •