Base | Representation |
---|---|
bin | 11111110011101011101… |
… | …01101011011011101111 |
3 | 10212110221222201022002021 |
4 | 33321311311223123233 |
5 | 120401224031331431 |
6 | 2154023140011011 |
7 | 141650022444031 |
oct | 17716565533357 |
9 | 3773858638067 |
10 | 1092898698991 |
11 | 39154a907490 |
12 | 157989690a67 |
13 | 7c0a17c4608 |
14 | 3ac7a2dbc51 |
15 | 1d667326b11 |
hex | fe75d6b6ef |
1092898698991 has 4 divisors (see below), whose sum is σ = 1192253126184. Its totient is φ = 993544271800.
The previous prime is 1092898698973. The next prime is 1092898699019. The reversal of 1092898698991 is 1998968982901.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1092898698991 - 27 = 1092898698863 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1092898698961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49677213580 + ... + 49677213601.
It is an arithmetic number, because the mean of its divisors is an integer number (298063281546).
Almost surely, 21092898698991 is an apocalyptic number.
1092898698991 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1092898698991 is a deficient number, since it is larger than the sum of its proper divisors (99354427193).
1092898698991 is an equidigital number, since it uses as much as digits as its factorization.
1092898698991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99354427192.
The product of its (nonzero) digits is 362797056, while the sum is 79.
The spelling of 1092898698991 in words is "one trillion, ninety-two billion, eight hundred ninety-eight million, six hundred ninety-eight thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •