Base | Representation |
---|---|
bin | 1101101100000101100011… |
… | …00101000101111001110111 |
3 | 10221120201210210212100021211 |
4 | 12312002301211011321313 |
5 | 12421143110141213421 |
6 | 144004415105022251 |
7 | 6224543231052046 |
oct | 666026145057167 |
9 | 127521723770254 |
10 | 30102110101111 |
11 | 9656262434374 |
12 | 3461ba7924987 |
13 | 13a4803165419 |
14 | 760d4276655d |
15 | 3730593c39e1 |
hex | 1b60b1945e77 |
30102110101111 has 16 divisors (see below), whose sum is σ = 31772083498240. Its totient is φ = 28440804913920.
The previous prime is 30102110101087. The next prime is 30102110101163. The reversal of 30102110101111 is 11110101120103.
It is a cyclic number.
It is not a de Polignac number, because 30102110101111 - 215 = 30102110068343 is a prime.
It is a super-2 number, since 2×301021101011112 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30102110101091 and 30102110101100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30105110101111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9093496 + ... + 11953906.
It is an arithmetic number, because the mean of its divisors is an integer number (1985755218640).
Almost surely, 230102110101111 is an apocalyptic number.
30102110101111 is a deficient number, since it is larger than the sum of its proper divisors (1669973397129).
30102110101111 is a wasteful number, since it uses less digits than its factorization.
30102110101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2861926.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 30102110101111 its reverse (11110101120103), we get a palindrome (41212211221214).
The spelling of 30102110101111 in words is "thirty trillion, one hundred two billion, one hundred ten million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •