Base | Representation |
---|---|
bin | 100000011011011… |
… | …0110101111010101 |
3 | 2210211111022111220 |
4 | 1000312312233111 |
5 | 4212024344223 |
6 | 255550120553 |
7 | 35651611542 |
oct | 10066665725 |
9 | 2724438456 |
10 | 1088121813 |
11 | 509242029 |
12 | 2644b0159 |
13 | 14458227c |
14 | a4729bc9 |
15 | 657db6e3 |
hex | 40db6bd5 |
1088121813 has 4 divisors (see below), whose sum is σ = 1450829088. Its totient is φ = 725414540.
The previous prime is 1088121799. The next prime is 1088121823. The reversal of 1088121813 is 3181218801.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3181218801 = 3 ⋅1060406267.
It is a cyclic number.
It is not a de Polignac number, because 1088121813 - 25 = 1088121781 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1088121823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 181353633 + ... + 181353638.
It is an arithmetic number, because the mean of its divisors is an integer number (362707272).
Almost surely, 21088121813 is an apocalyptic number.
It is an amenable number.
1088121813 is a deficient number, since it is larger than the sum of its proper divisors (362707275).
1088121813 is an equidigital number, since it uses as much as digits as its factorization.
1088121813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362707274.
The product of its (nonzero) digits is 3072, while the sum is 33.
The square root of 1088121813 is about 32986.6914527662. The cubic root of 1088121813 is about 1028.5510190863.
The spelling of 1088121813 in words is "one billion, eighty-eight million, one hundred twenty-one thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •