Base | Representation |
---|---|
bin | 1101101100000001110100… |
… | …10111101100101001110111 |
3 | 10221120112122102111211001202 |
4 | 12312000322113230221313 |
5 | 12421130011141213421 |
6 | 144003444422043115 |
7 | 6224442534250211 |
oct | 666007227545167 |
9 | 127515572454052 |
10 | 30100110101111 |
11 | 9655426497806 |
12 | 3461729b7949b |
13 | 13a45749bb07b |
14 | 760bd2cab5b1 |
15 | 372e8da1110b |
hex | 1b603a5eca77 |
30100110101111 has 4 divisors (see below), whose sum is σ = 30100128981000. Its totient is φ = 30100091221224.
The previous prime is 30100110101101. The next prime is 30100110101179. The reversal of 30100110101111 is 11110101100103.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30100110101111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30100110101092 and 30100110101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30100110101101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6802961 + ... + 10318938.
It is an arithmetic number, because the mean of its divisors is an integer number (7525032245250).
Almost surely, 230100110101111 is an apocalyptic number.
30100110101111 is a deficient number, since it is larger than the sum of its proper divisors (18879889).
30100110101111 is a wasteful number, since it uses less digits than its factorization.
30100110101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18879888.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 30100110101111 its reverse (11110101100103), we get a palindrome (41210211201214).
The spelling of 30100110101111 in words is "thirty trillion, one hundred billion, one hundred ten million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •