Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …111000110100011111111 |
3 | 10221010100220210001102101 |
4 | 100021313033012203333 |
5 | 121141442103310421 |
6 | 2205550202405531 |
7 | 143126235253033 |
oct | 20116717064377 |
9 | 3833326701371 |
10 | 1110102010111 |
11 | 39887870a786 |
12 | 15b18ab008a7 |
13 | 808b3961153 |
14 | 3ba2cdc21c3 |
15 | 1dd227ae191 |
hex | 102773c68ff |
1110102010111 has 8 divisors (see below), whose sum is σ = 1159751505600. Its totient is φ = 1061210522400.
The previous prime is 1110102010067. The next prime is 1110102010117.
1110102010111 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110102010111 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 (1110102010117) 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, 189498951 + ... + 189504808.
It is an arithmetic number, because the mean of its divisors is an integer number (144968938200).
Almost surely, 21110102010111 is an apocalyptic number.
1110102010111 is a deficient number, since it is larger than the sum of its proper divisors (49649495489).
1110102010111 is a wasteful number, since it uses less digits than its factorization.
1110102010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379003889.
The product of its (nonzero) digits is 2, while the sum is 10.
The spelling of 1110102010111 in words is "one trillion, one hundred ten billion, one hundred two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •