Base | Representation |
---|---|
bin | 11100100101101000… |
… | …100110111110100000 |
3 | 2221020021021011211210 |
4 | 130211220212332200 |
5 | 1000331210022342 |
6 | 22033541310120 |
7 | 2134452112056 |
oct | 344550467640 |
9 | 87207234753 |
10 | 30696173472 |
11 | 1202220a508 |
12 | 5b48105340 |
13 | 2b82694873 |
14 | 16b2aa81d6 |
15 | be9ce279c |
hex | 725a26fa0 |
30696173472 has 48 divisors (see below), whose sum is σ = 80982417600. Its totient is φ = 10180634112.
The previous prime is 30696173449. The next prime is 30696173477. The reversal of 30696173472 is 27437169603.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (30696173477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 784293 + ... + 822500.
It is an arithmetic number, because the mean of its divisors is an integer number (1687133700).
Almost surely, 230696173472 is an apocalyptic number.
30696173472 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30696173472 is an abundant number, since it is smaller than the sum of its proper divisors (50286244128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30696173472 is a wasteful number, since it uses less digits than its factorization.
30696173472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1607005 (or 1606997 counting only the distinct ones).
The product of its (nonzero) digits is 1143072, while the sum is 48.
The spelling of 30696173472 in words is "thirty billion, six hundred ninety-six million, one hundred seventy-three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •