Base | Representation |
---|---|
bin | 10100011111011010… |
… | …01101000010110111 |
3 | 1001101200011222000012 |
4 | 22033231031002313 |
5 | 140012214121031 |
6 | 5015340010435 |
7 | 536420221460 |
oct | 121755150267 |
9 | 31350158005 |
10 | 11000926391 |
11 | 4735810904 |
12 | 2170230a1b |
13 | 1064190200 |
14 | 765071d67 |
15 | 445bc3b2b |
hex | 28fb4d0b7 |
11000926391 has 24 divisors (see below), whose sum is σ = 13652444160. Its totient is φ = 8679449376.
The previous prime is 11000926379. The next prime is 11000926399. The reversal of 11000926391 is 19362900011.
It is not a de Polignac number, because 11000926391 - 26 = 11000926327 is a prime.
It is a super-3 number, since 3×110009263913 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000926399) 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, 411746 + ... + 437648.
It is an arithmetic number, because the mean of its divisors is an integer number (568851840).
Almost surely, 211000926391 is an apocalyptic number.
11000926391 is a deficient number, since it is larger than the sum of its proper divisors (2651517769).
11000926391 is a wasteful number, since it uses less digits than its factorization.
11000926391 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26295 (or 26282 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 32.
The spelling of 11000926391 in words is "eleven billion, nine hundred twenty-six thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •