Base | Representation |
---|---|
bin | 11100101001001000… |
… | …001110000010000000 |
3 | 2221101100120021201210 |
4 | 130221020032002000 |
5 | 1000441211312202 |
6 | 22043433530120 |
7 | 2136063262212 |
oct | 345110160200 |
9 | 87340507653 |
10 | 30754791552 |
11 | 12052307101 |
12 | 5b63873940 |
13 | 2b91879814 |
14 | 16ba7a65b2 |
15 | c00020c6c |
hex | 72920e080 |
30754791552 has 64 divisors (see below), whose sum is σ = 81803714400. Its totient is φ = 10237630464.
The previous prime is 30754791539. The next prime is 30754791569. The reversal of 30754791552 is 25519745703.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 229588 + ... + 337964.
Almost surely, 230754791552 is an apocalyptic number.
30754791552 is a gapful number since it is divisible by the number (32) 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 30754791552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40901857200).
30754791552 is an abundant number, since it is smaller than the sum of its proper divisors (51048922848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30754791552 is a wasteful number, since it uses less digits than its factorization.
30754791552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109133 (or 109121 counting only the distinct ones).
The product of its (nonzero) digits is 1323000, while the sum is 48.
The spelling of 30754791552 in words is "thirty billion, seven hundred fifty-four million, seven hundred ninety-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •