Base | Representation |
---|---|
bin | 10000000101100111111… |
… | …100011110000100001101 |
3 | 10220200121201022101110212 |
4 | 100011213330132010031 |
5 | 121103131412000414 |
6 | 2203514412012205 |
7 | 142605400125416 |
oct | 20054774360415 |
9 | 3820551271425 |
10 | 1105550500109 |
11 | 396952487970 |
12 | 15a31a761065 |
13 | 803399c0b73 |
14 | 3b71a70880d |
15 | 1db57de883e |
hex | 10167f1e10d |
1105550500109 has 4 divisors (see below), whose sum is σ = 1206055091040. Its totient is φ = 1005045909180.
The previous prime is 1105550500097. The next prime is 1105550500133. The reversal of 1105550500109 is 9010050555011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1105550500109 - 236 = 1036831023373 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1105550500169) 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 3 ways as a sum of consecutive naturals, for example, 50252295449 + ... + 50252295470.
It is an arithmetic number, because the mean of its divisors is an integer number (301513772760).
Almost surely, 21105550500109 is an apocalyptic number.
It is an amenable number.
1105550500109 is a deficient number, since it is larger than the sum of its proper divisors (100504590931).
1105550500109 is a wasteful number, since it uses less digits than its factorization.
1105550500109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100504590930.
The product of its (nonzero) digits is 5625, while the sum is 32.
The spelling of 1105550500109 in words is "one trillion, one hundred five billion, five hundred fifty million, five hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •