Base | Representation |
---|---|
bin | 11100001110000001… |
… | …101110000111000111 |
3 | 2220012122222201110011 |
4 | 130032001232013013 |
5 | 444023311244421 |
6 | 21530352211051 |
7 | 2121602425015 |
oct | 341601560707 |
9 | 86178881404 |
10 | 30300103111 |
11 | 11939688a33 |
12 | 5a57539a87 |
13 | 2b1b5caac5 |
14 | 16762478b5 |
15 | bc51584e1 |
hex | 70e06e1c7 |
30300103111 has 16 divisors (see below), whose sum is σ = 33340518400. Its totient is φ = 27427701600.
The previous prime is 30300103039. The next prime is 30300103117. The reversal of 30300103111 is 11130100303.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 30300103111 - 213 = 30300094919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30300103091 and 30300103100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30300103117) 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 15 ways as a sum of consecutive naturals, for example, 279060 + ... + 372121.
It is an arithmetic number, because the mean of its divisors is an integer number (2083782400).
Almost surely, 230300103111 is an apocalyptic number.
30300103111 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
30300103111 is a deficient number, since it is larger than the sum of its proper divisors (3040415289).
30300103111 is a wasteful number, since it uses less digits than its factorization.
30300103111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651310.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 30300103111 its reverse (11130100303), we get a palindrome (41430203414).
The spelling of 30300103111 in words is "thirty billion, three hundred million, one hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •