Base | Representation |
---|---|
bin | 11100000010001111… |
… | …001010111001101001 |
3 | 2212200212210101202200 |
4 | 130002033022321221 |
5 | 443122142133223 |
6 | 21455004450413 |
7 | 2113651230216 |
oct | 340217127151 |
9 | 85625711680 |
10 | 30102302313 |
11 | 11847a682a6 |
12 | 5a01249a09 |
13 | 2ab9633805 |
14 | 1657c78b0d |
15 | bb2ad5a43 |
hex | 7023cae69 |
30102302313 has 12 divisors (see below), whose sum is σ = 43540432260. Its totient is φ = 20040818976.
The previous prime is 30102302309. The next prime is 30102302327. The reversal of 30102302313 is 31320320103.
It can be written as a sum of positive squares in 2 ways, for example, as 24866766864 + 5235535449 = 157692^2 + 72357^2 .
It is not a de Polignac number, because 30102302313 - 22 = 30102302309 is a prime.
It is a super-2 number, since 2×301023023132 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30102302333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2274918 + ... + 2288111.
It is an arithmetic number, because the mean of its divisors is an integer number (3628369355).
Almost surely, 230102302313 is an apocalyptic number.
It is an amenable number.
30102302313 is a deficient number, since it is larger than the sum of its proper divisors (13438129947).
30102302313 is a wasteful number, since it uses less digits than its factorization.
30102302313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4563768 (or 4563765 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 30102302313 its reverse (31320320103), we get a palindrome (61422622416).
The spelling of 30102302313 in words is "thirty billion, one hundred two million, three hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •