Base | Representation |
---|---|
bin | 11100001110101111… |
… | …110111111100011101 |
3 | 2220020111202102000122 |
4 | 130032233313330131 |
5 | 444034410431023 |
6 | 21531503404325 |
7 | 2122110315542 |
oct | 341657677435 |
9 | 86214672018 |
10 | 30312202013 |
11 | 119454a2025 |
12 | 5a5b5b36a5 |
13 | 2b20c75b12 |
14 | 1677ab6bc9 |
15 | bc62482c8 |
hex | 70ebf7f1d |
30312202013 has 8 divisors (see below), whose sum is σ = 30537675000. Its totient is φ = 30086790400.
The previous prime is 30312201991. The next prime is 30312202031. The reversal of 30312202013 is 31020221303.
It can be written as a sum of positive squares in 4 ways, for example, as 7627926244 + 22684275769 = 87338^2 + 150613^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 30312202013 - 212 = 30312197917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30312201982 and 30312202000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30312202813) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1607363 + ... + 1626111.
It is an arithmetic number, because the mean of its divisors is an integer number (3817209375).
Almost surely, 230312202013 is an apocalyptic number.
It is an amenable number.
30312202013 is a deficient number, since it is larger than the sum of its proper divisors (225472987).
30312202013 is a wasteful number, since it uses less digits than its factorization.
30312202013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30687.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 30312202013 its reverse (31020221303), we get a palindrome (61332423316).
The spelling of 30312202013 in words is "thirty billion, three hundred twelve million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •