Base | Representation |
---|---|
bin | 11100011011010000… |
… | …100101110100011001 |
3 | 2220210010201120221112 |
4 | 130123100211310121 |
5 | 1000002124330423 |
6 | 22004402350105 |
7 | 2130236420123 |
oct | 343320456431 |
9 | 86703646845 |
10 | 30522105113 |
11 | 11a42a29365 |
12 | 5ab995b335 |
13 | 2b555b9836 |
14 | 1697916213 |
15 | bd98aba78 |
hex | 71b425d19 |
30522105113 has 4 divisors (see below), whose sum is σ = 30522455040. Its totient is φ = 30521755188.
The previous prime is 30522105091. The next prime is 30522105121. The reversal of 30522105113 is 31150122503.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 30522105113 - 218 = 30521842969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30522105143) 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 3 ways as a sum of consecutive naturals, for example, 73256 + ... + 257702.
It is an arithmetic number, because the mean of its divisors is an integer number (7630613760).
Almost surely, 230522105113 is an apocalyptic number.
It is an amenable number.
30522105113 is a deficient number, since it is larger than the sum of its proper divisors (349927).
30522105113 is a wasteful number, since it uses less digits than its factorization.
30522105113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349926.
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 30522105113 its reverse (31150122503), we get a palindrome (61672227616).
The spelling of 30522105113 in words is "thirty billion, five hundred twenty-two million, one hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •