Base | Representation |
---|---|
bin | 11011111100100001… |
… | …100000001111110101 |
3 | 2212110012102100022111 |
4 | 123330201200033311 |
5 | 442423122220140 |
6 | 21441302131021 |
7 | 2111405401033 |
oct | 337441401765 |
9 | 85405370274 |
10 | 30006445045 |
11 | 117a8946315 |
12 | 5995120a71 |
13 | 2aa2810835 |
14 | 1649245553 |
15 | ba949d7ea |
hex | 6fc8603f5 |
30006445045 has 8 divisors (see below), whose sum is σ = 36098436024. Its totient is φ = 23944688064.
The previous prime is 30006445043. The next prime is 30006445057. The reversal of 30006445045 is 54054460003.
It can be written as a sum of positive squares in 4 ways, for example, as 193933476 + 29812511569 = 13926^2 + 172663^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30006445045 - 21 = 30006445043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30006444998 and 30006445016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30006445043) 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 7 ways as a sum of consecutive naturals, for example, 7556314 + ... + 7560283.
It is an arithmetic number, because the mean of its divisors is an integer number (4512304503).
Almost surely, 230006445045 is an apocalyptic number.
It is an amenable number.
30006445045 is a deficient number, since it is larger than the sum of its proper divisors (6091990979).
30006445045 is a wasteful number, since it uses less digits than its factorization.
30006445045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15116999.
The product of its (nonzero) digits is 28800, while the sum is 31.
The spelling of 30006445045 in words is "thirty billion, six million, four hundred forty-five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •