Base | Representation |
---|---|
bin | 11111110000010101001… |
… | …01001000101001100101 |
3 | 10212022022120122021200020 |
4 | 33320022211020221211 |
5 | 120334032343400401 |
6 | 2153124414305353 |
7 | 141554312114421 |
oct | 17701245105145 |
9 | 3768276567606 |
10 | 1091099200101 |
11 | 390807065319 |
12 | 157566ab8259 |
13 | 7bb75a4b681 |
14 | 3ab49315b81 |
15 | 1d5ae36bd36 |
hex | fe0a948a65 |
1091099200101 has 8 divisors (see below), whose sum is σ = 1454975970720. Its totient is φ = 727310948112.
The previous prime is 1091099200073. The next prime is 1091099200171. The reversal of 1091099200101 is 1010029901901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1091099200101 - 213 = 1091099191909 is a prime.
It is a super-2 number, since 2×10910992001012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1091099200171) 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 7 ways as a sum of consecutive naturals, for example, 22100890 + ... + 22150203.
It is an arithmetic number, because the mean of its divisors is an integer number (181871996340).
Almost surely, 21091099200101 is an apocalyptic number.
It is an amenable number.
1091099200101 is a deficient number, since it is larger than the sum of its proper divisors (363876770619).
1091099200101 is an equidigital number, since it uses as much as digits as its factorization.
1091099200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44259315.
The product of its (nonzero) digits is 1458, while the sum is 33.
The spelling of 1091099200101 in words is "one trillion, ninety-one billion, ninety-nine million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •