Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …100001111001101110001 |
3 | 10220100202000111021020001 |
4 | 100002122330033031301 |
5 | 121024110421010001 |
6 | 2202145225550001 |
7 | 142424224603126 |
oct | 20023274171561 |
9 | 3810660437201 |
10 | 1102111110001 |
11 | 395447a98200 |
12 | 15971a945301 |
13 | 7cc0c285ca5 |
14 | 3b4b1a0674d |
15 | 1da05eb0001 |
hex | 1009af0f371 |
1102111110001 has 24 divisors (see below), whose sum is σ = 1219297184000. Its totient is φ = 995415268320.
The previous prime is 1102111109999. The next prime is 1102111110017. The reversal of 1102111110001 is 1000111112011.
It is not a de Polignac number, because 1102111110001 - 21 = 1102111109999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1102111110001.
It is not an unprimeable number, because it can be changed into a prime (1102111110041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13423591 + ... + 13505443.
Almost surely, 21102111110001 is an apocalyptic number.
1102111110001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1102111110001 is a deficient number, since it is larger than the sum of its proper divisors (117186073999).
1102111110001 is a wasteful number, since it uses less digits than its factorization.
1102111110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82597 (or 82586 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1102111110001 its reverse (1000111112011), we get a palindrome (2102222222012).
The spelling of 1102111110001 in words is "one trillion, one hundred two billion, one hundred eleven million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •