Base | Representation |
---|---|
bin | 11111110000111000111… |
… | …00111011111110001111 |
3 | 10212100002110211202221102 |
4 | 33320130130323332033 |
5 | 120340141123302121 |
6 | 2153214245053315 |
7 | 141564612532034 |
oct | 17703434737617 |
9 | 3770073752842 |
10 | 1091399040911 |
11 | 390950340143 |
12 | 15762b3b723b |
13 | 7bbc2bc1b7a |
14 | 3ab7708738b |
15 | 1d5ca84890b |
hex | fe1c73bf8f |
1091399040911 has 8 divisors (see below), whose sum is σ = 1175185409040. Its totient is φ = 1009788942208.
The previous prime is 1091399040881. The next prime is 1091399040913. The reversal of 1091399040911 is 1190409931901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1091399040911 - 26 = 1091399040847 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 (1091399040913) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 544066316 + ... + 544068321.
It is an arithmetic number, because the mean of its divisors is an integer number (146898176130).
Almost surely, 21091399040911 is an apocalyptic number.
1091399040911 is a deficient number, since it is larger than the sum of its proper divisors (83786368129).
1091399040911 is a wasteful number, since it uses less digits than its factorization.
1091399040911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1088134713.
The product of its (nonzero) digits is 78732, while the sum is 47.
The spelling of 1091399040911 in words is "one trillion, ninety-one billion, three hundred ninety-nine million, forty thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •