Base | Representation |
---|---|
bin | 11100000010001110… |
… | …000100010010110001 |
3 | 2212200212020201001021 |
4 | 130002032010102301 |
5 | 443122103404410 |
6 | 21454554335441 |
7 | 2113645614103 |
oct | 340216042261 |
9 | 85625221037 |
10 | 30102013105 |
11 | 1184788aa8a |
12 | 5a0112a581 |
13 | 2ab9561c98 |
14 | 1657c01573 |
15 | bb2a79eda |
hex | 7023844b1 |
30102013105 has 8 divisors (see below), whose sum is σ = 36136759464. Its totient is φ = 24072048000.
The previous prime is 30102013093. The next prime is 30102013127. The reversal of 30102013105 is 50131020103.
It can be written as a sum of positive squares in 4 ways, for example, as 2524761009 + 27577252096 = 50247^2 + 166064^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30102013105 - 223 = 30093624497 is a prime.
It is a super-2 number, since 2×301020131052 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1181446 + ... + 1206655.
It is an arithmetic number, because the mean of its divisors is an integer number (4517094933).
Almost surely, 230102013105 is an apocalyptic number.
It is an amenable number.
30102013105 is a deficient number, since it is larger than the sum of its proper divisors (6034746359).
30102013105 is a wasteful number, since it uses less digits than its factorization.
30102013105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2390627.
The product of its (nonzero) digits is 90, while the sum is 16.
Adding to 30102013105 its reverse (50131020103), we get a palindrome (80233033208).
The spelling of 30102013105 in words is "thirty billion, one hundred two million, thirteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •