Base | Representation |
---|---|
bin | 10000000101001101011… |
… | …101000010111101111111 |
3 | 10220122110202000020110100 |
4 | 100011031131002331333 |
5 | 121101224122230124 |
6 | 2203402334012143 |
7 | 142561362323250 |
oct | 20051535027577 |
9 | 3818422006410 |
10 | 1105106055039 |
11 | 396744615798 |
12 | 15a215947053 |
13 | 802988ba70c |
14 | 3b6b7694b27 |
15 | 1db2dda61c9 |
hex | 1014d742f7f |
1105106055039 has 48 divisors (see below), whose sum is σ = 1944625945600. Its totient is φ = 590680029888.
The previous prime is 1105106055013. The next prime is 1105106055089. The reversal of 1105106055039 is 9305506015011.
1105106055039 is a `hidden beast` number, since 1 + 1 + 0 + 5 + 10 + 60 + 550 + 39 = 666.
It is not a de Polignac number, because 1105106055039 - 28 = 1105106054783 is a prime.
It is a super-2 number, since 2×11051060550392 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1105106054994 and 1105106055012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1105106055089) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5748664 + ... + 5937789.
Almost surely, 21105106055039 is an apocalyptic number.
1105106055039 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
1105106055039 is a deficient number, since it is larger than the sum of its proper divisors (839519890561).
1105106055039 is a wasteful number, since it uses less digits than its factorization.
1105106055039 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11686564 (or 11686561 counting only the distinct ones).
The product of its (nonzero) digits is 20250, while the sum is 36.
The spelling of 1105106055039 in words is "one trillion, one hundred five billion, one hundred six million, fifty-five thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •