Base | Representation |
---|---|
bin | 11111110010000000101… |
… | …00111000101100001011 |
3 | 10212101122102100220020112 |
4 | 33321000110320230023 |
5 | 120342404213110331 |
6 | 2153354105144535 |
7 | 141615541404500 |
oct | 17710024705413 |
9 | 3771572326215 |
10 | 1092000910091 |
11 | 39112a055393 |
12 | 157778a8b14b |
13 | 7bc8a7c3490 |
14 | 3abd2d994a7 |
15 | 1d6135d532b |
hex | fe40538b0b |
1092000910091 has 24 divisors (see below), whose sum is σ = 1368144608544. Its totient is φ = 863910109440.
The previous prime is 1092000910081. The next prime is 1092000910111. The reversal of 1092000910091 is 1900190002901.
It is not a de Polignac number, because 1092000910091 - 26 = 1092000910027 is a prime.
1092000910091 is a modest number, since divided by 910091 gives 10920 as remainder.
It is not an unprimeable number, because it can be changed into a prime (1092000910061) 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, 6350771 + ... + 6520451.
It is an arithmetic number, because the mean of its divisors is an integer number (57006025356).
Almost surely, 21092000910091 is an apocalyptic number.
1092000910091 is a deficient number, since it is larger than the sum of its proper divisors (276143698453).
1092000910091 is a wasteful number, since it uses less digits than its factorization.
1092000910091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179811 (or 179804 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 32.
Adding to 1092000910091 its reverse (1900190002901), we get a palindrome (2992190912992).
The spelling of 1092000910091 in words is "one trillion, ninety-two billion, nine hundred ten thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •