Base | Representation |
---|---|
bin | 11100000000000111… |
… | …011000000010011000 |
3 | 2212121101210211210111 |
4 | 130000013120002120 |
5 | 443034034021121 |
6 | 21451253454104 |
7 | 2113036525501 |
oct | 340007300230 |
9 | 85541724714 |
10 | 30066704536 |
11 | 11829964150 |
12 | 59b1341334 |
13 | 2ab214b93b |
14 | 165324dba8 |
15 | bae9032e1 |
hex | 7001d8098 |
30066704536 has 48 divisors (see below), whose sum is σ = 62682865560. Its totient is φ = 13408711680.
The previous prime is 30066704519. The next prime is 30066704539. The reversal of 30066704536 is 63540766003.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30066704539) 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 11 ways as a sum of consecutive naturals, for example, 186376 + ... + 308008.
Almost surely, 230066704536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30066704536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31341432780).
30066704536 is an abundant number, since it is smaller than the sum of its proper divisors (32616161024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30066704536 is a wasteful number, since it uses less digits than its factorization.
30066704536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121756 (or 121699 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 40.
The spelling of 30066704536 in words is "thirty billion, sixty-six million, seven hundred four thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •