Base | Representation |
---|---|
bin | 11100010001111101… |
… | …100110101010010101 |
3 | 2220101021020101021100 |
4 | 130101331212222111 |
5 | 444142212223020 |
6 | 21541111340313 |
7 | 2123333604444 |
oct | 342175465225 |
9 | 86337211240 |
10 | 30366132885 |
11 | 119729880a0 |
12 | 5a75681699 |
13 | 2b2c1a948a |
14 | 1680d14d5b |
15 | bcad4ca90 |
hex | 711f66a95 |
30366132885 has 48 divisors (see below), whose sum is σ = 57838847040. Its totient is φ = 14615473920.
The previous prime is 30366132883. The next prime is 30366132889. The reversal of 30366132885 is 58823166303.
30366132885 is a `hidden beast` number, since 3 + 0 + 3 + 6 + 613 + 28 + 8 + 5 = 666.
It is not a de Polignac number, because 30366132885 - 21 = 30366132883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 30366132885.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30366132883) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 156075 + ... + 291704.
It is an arithmetic number, because the mean of its divisors is an integer number (1204975980).
Almost surely, 230366132885 is an apocalyptic number.
It is an amenable number.
30366132885 is a deficient number, since it is larger than the sum of its proper divisors (27472714155).
30366132885 is a wasteful number, since it uses less digits than its factorization.
30366132885 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447938 (or 447935 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 45.
The spelling of 30366132885 in words is "thirty billion, three hundred sixty-six million, one hundred thirty-two thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •