Base | Representation |
---|---|
bin | 11100010110011001… |
… | …010011111101000000 |
3 | 2220120110011212211202 |
4 | 130112121103331000 |
5 | 444320232131102 |
6 | 21552325400332 |
7 | 2125226011301 |
oct | 342631237500 |
9 | 86513155752 |
10 | 30440505152 |
11 | 11a00965082 |
12 | 5a965690a8 |
13 | 2b41719135 |
14 | 168ab547a8 |
15 | bd263de02 |
hex | 716653f40 |
30440505152 has 84 divisors (see below), whose sum is σ = 63511297920. Its totient is φ = 14474287872.
The previous prime is 30440505143. The next prime is 30440505191. The reversal of 30440505152 is 25150504403.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 6057713 + ... + 6062735.
It is an arithmetic number, because the mean of its divisors is an integer number (756086880).
Almost surely, 230440505152 is an apocalyptic number.
30440505152 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 30440505152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31755648960).
30440505152 is an abundant number, since it is smaller than the sum of its proper divisors (33070792768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30440505152 is a wasteful number, since it uses less digits than its factorization.
30440505152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5260 (or 5227 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 29.
The spelling of 30440505152 in words is "thirty billion, four hundred forty million, five hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •