Base | Representation |
---|---|
bin | 11100001100000100… |
… | …000101001001100000 |
3 | 2220010101000102001100 |
4 | 130030010011021200 |
5 | 443441343323303 |
6 | 21523214234400 |
7 | 2121022451226 |
oct | 341404051140 |
9 | 86111012040 |
10 | 30267167328 |
11 | 11922032882 |
12 | 5a484b5a00 |
13 | 2b14838788 |
14 | 1671b12b16 |
15 | bc22ee8a3 |
hex | 70c105260 |
30267167328 has 36 divisors (see below), whose sum is σ = 86072257908. Its totient is φ = 10089055680.
The previous prime is 30267167327. The next prime is 30267167351. The reversal of 30267167328 is 82376176203.
30267167328 is a `hidden beast` number, since 3 + 0 + 267 + 1 + 67 + 328 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×302671673282 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30267167323) 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 5 ways as a sum of consecutive naturals, for example, 52546878 + ... + 52547453.
It is an arithmetic number, because the mean of its divisors is an integer number (2390896053).
Almost surely, 230267167328 is an apocalyptic number.
It is an amenable number.
30267167328 is an abundant number, since it is smaller than the sum of its proper divisors (55805090580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30267167328 is a wasteful number, since it uses less digits than its factorization.
30267167328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105094347 (or 105094336 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 45.
The spelling of 30267167328 in words is "thirty billion, two hundred sixty-seven million, one hundred sixty-seven thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •