Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …110001100110001010110 |
3 | 10221010002212220210122000 |
4 | 100021301032030301112 |
5 | 121141240241010402 |
6 | 2205532200020130 |
7 | 143123601521643 |
oct | 20116116146126 |
9 | 3833085823560 |
10 | 1110001110102 |
11 | 398826764045 |
12 | 15b161161646 |
13 | 80898a93ac1 |
14 | 3ba1d838dca |
15 | 1dd189ccc1c |
hex | 1027138cc56 |
1110001110102 has 32 divisors (see below), whose sum is σ = 2596493827200. Its totient is φ = 350526666024.
The previous prime is 1110001110073. The next prime is 1110001110131. The reversal of 1110001110102 is 2010111000111.
It is an interprime number because it is at equal distance from previous prime (1110001110073) and next prime (1110001110131).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
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, 540935188 + ... + 540937239.
It is an arithmetic number, because the mean of its divisors is an integer number (81140432100).
Almost surely, 21110001110102 is an apocalyptic number.
1110001110102 is an abundant number, since it is smaller than the sum of its proper divisors (1486492717098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110001110102 is a wasteful number, since it uses less digits than its factorization.
1110001110102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1081872457 (or 1081872451 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1110001110102 its reverse (2010111000111), we get a palindrome (3120112110213).
The spelling of 1110001110102 in words is "one trillion, one hundred ten billion, one million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •