Base | Representation |
---|---|
bin | 11011111100110001… |
… | …100000001111100101 |
3 | 2212110111022102210111 |
4 | 123330301200033211 |
5 | 442430210424313 |
6 | 21441532053021 |
7 | 2111456140213 |
oct | 337461401745 |
9 | 85414272714 |
10 | 30010639333 |
11 | 11800250574 |
12 | 5996604171 |
13 | 2aa364b96c |
14 | 1649a17cb3 |
15 | ba9a2b43d |
hex | 6fcc603e5 |
30010639333 has 8 divisors (see below), whose sum is σ = 30938425560. Its totient is φ = 29092177920.
The previous prime is 30010639319. The next prime is 30010639349. The reversal of 30010639333 is 33393601003.
It can be written as a sum of positive squares in 4 ways, for example, as 255424324 + 29755215009 = 15982^2 + 172497^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 30010639333 - 25 = 30010639301 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30010639295 and 30010639304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30010639303) 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, 2324668 + ... + 2337541.
It is an arithmetic number, because the mean of its divisors is an integer number (3867303195).
Almost surely, 230010639333 is an apocalyptic number.
It is an amenable number.
30010639333 is a deficient number, since it is larger than the sum of its proper divisors (927786227).
30010639333 is a wasteful number, since it uses less digits than its factorization.
30010639333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4662407.
The product of its (nonzero) digits is 13122, while the sum is 31.
The spelling of 30010639333 in words is "thirty billion, ten million, six hundred thirty-nine thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •