Base | Representation |
---|---|
bin | 11100000000000000… |
… | …000000000000000000 |
3 | 2212121021011121120201 |
4 | 130000000000000000 |
5 | 443033040133242 |
6 | 21451144214544 |
7 | 2113014223540 |
oct | 340000000000 |
9 | 85537147521 |
10 | 30064771072 |
11 | 11828863546 |
12 | 59b076a454 |
13 | 2ab192288b |
14 | 1652ca9320 |
15 | bae6704b7 |
hex | 700000000 |
30064771072 has 66 divisors (see below), whose sum is σ = 68719476728. Its totient is φ = 12884901888.
The previous prime is 30064771027. The next prime is 30064771081. The reversal of 30064771072 is 27017746003.
It is a super-2 number, since 2×300647710722 (a number of 22 digits) contains 22 as substring.
It is a nialpdrome in base 2 and base 16.
It is a zygodrome in base 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (3) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4294967293 + ... + 4294967299.
Almost surely, 230064771072 is an apocalyptic number.
30064771072 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 30064771072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34359738364).
30064771072 is an abundant number, since it is smaller than the sum of its proper divisors (38654705656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30064771072 is an frugal number, since it uses more digits than its factorization.
30064771072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71 (or 9 counting only the distinct ones).
The product of its (nonzero) digits is 49392, while the sum is 37.
The spelling of 30064771072 in words is "thirty billion, sixty-four million, seven hundred seventy-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •