Base | Representation |
---|---|
bin | 11100000010011001… |
… | …011110111000001101 |
3 | 2212201001212201221201 |
4 | 130002121132320031 |
5 | 443123340134311 |
6 | 21455142425501 |
7 | 2114013216400 |
oct | 340231367015 |
9 | 85631781851 |
10 | 30105005581 |
11 | 11849544302 |
12 | 5a02132291 |
13 | 2aba06c091 |
14 | 165837dd37 |
15 | bb2e6b9c1 |
hex | 70265ee0d |
30105005581 has 24 divisors (see below), whose sum is σ = 35154699840. Its totient is φ = 25705354752.
The previous prime is 30105005467. The next prime is 30105005591. The reversal of 30105005581 is 18550050103.
It is not a de Polignac number, because 30105005581 - 229 = 29568134669 is a prime.
It is a super-2 number, since 2×301050055812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30105005591) 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 23 ways as a sum of consecutive naturals, for example, 19309680 + ... + 19311238.
It is an arithmetic number, because the mean of its divisors is an integer number (1464779160).
Almost surely, 230105005581 is an apocalyptic number.
It is an amenable number.
30105005581 is a deficient number, since it is larger than the sum of its proper divisors (5049694259).
30105005581 is a wasteful number, since it uses less digits than its factorization.
30105005581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2833 (or 2826 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 30105005581 its reverse (18550050103), we get a palindrome (48655055684).
The spelling of 30105005581 in words is "thirty billion, one hundred five million, five thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •