Base | Representation |
---|---|
bin | 11101011101001011101… |
… | …11001011101101110111 |
3 | 10120202101222202012000002 |
4 | 32232211313023231313 |
5 | 113040240101133421 |
6 | 2052541411541515 |
7 | 133056532143344 |
oct | 16564567135567 |
9 | 3522358665002 |
10 | 1012100021111 |
11 | 360258092943 |
12 | 14419a2ba89b |
13 | 7459608064a |
14 | 36db345d7cb |
15 | 1b4d8b92b0b |
hex | eba5dcbb77 |
1012100021111 has 4 divisors (see below), whose sum is σ = 1012109635224. Its totient is φ = 1012090407000.
The previous prime is 1012100021081. The next prime is 1012100021131. The reversal of 1012100021111 is 1111200012101.
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-1012100021111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012100021092 and 1012100021101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012100021131) 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, 4647380 + ... + 4860281.
It is an arithmetic number, because the mean of its divisors is an integer number (253027408806).
Almost surely, 21012100021111 is an apocalyptic number.
1012100021111 is a deficient number, since it is larger than the sum of its proper divisors (9614113).
1012100021111 is an equidigital number, since it uses as much as digits as its factorization.
1012100021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9614112.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1012100021111 its reverse (1111200012101), we get a palindrome (2123300033212).
The spelling of 1012100021111 in words is "one trillion, twelve billion, one hundred million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •