Base | Representation |
---|---|
bin | 11011111100110011… |
… | …010101110111001101 |
3 | 2212110112012220122202 |
4 | 123330303111313031 |
5 | 442430321333401 |
6 | 21441550251245 |
7 | 2111463214613 |
oct | 337463256715 |
9 | 85415186582 |
10 | 30011121101 |
11 | 1180054a525 |
12 | 59967b6b25 |
13 | 2aa378a030 |
14 | 1649b016b3 |
15 | ba9ac406b |
hex | 6fccd5dcd |
30011121101 has 8 divisors (see below), whose sum is σ = 32400272184. Its totient is φ = 27633484800.
The previous prime is 30011121079. The next prime is 30011121131. The reversal of 30011121101 is 10112111003.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3495883876 + 26515237225 = 59126^2 + 162835^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 30011121101 - 210 = 30011120077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30011121131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2873276 + ... + 2883701.
It is an arithmetic number, because the mean of its divisors is an integer number (4050034023).
Almost surely, 230011121101 is an apocalyptic number.
It is an amenable number.
30011121101 is a deficient number, since it is larger than the sum of its proper divisors (2389151083).
30011121101 is a wasteful number, since it uses less digits than its factorization.
30011121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5757391.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 30011121101 its reverse (10112111003), we get a palindrome (40123232104).
The spelling of 30011121101 in words is "thirty billion, eleven million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •