Base | Representation |
---|---|
bin | 10100101010010110… |
… | …11001011001001101 |
3 | 1001122001220221021120 |
4 | 22111023121121031 |
5 | 140204214233443 |
6 | 5032415351153 |
7 | 541613425020 |
oct | 122513313115 |
9 | 31561827246 |
10 | 11092727373 |
11 | 4782612292 |
12 | 2196b224b9 |
13 | 107a1c2b10 |
14 | 77332b1b7 |
15 | 44dca9083 |
hex | 2952d964d |
11092727373 has 16 divisors (see below), whose sum is σ = 18203450496. Its totient is φ = 5851108800.
The previous prime is 11092727363. The next prime is 11092727423. The reversal of 11092727373 is 37372729011.
11092727373 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11092727373 - 24 = 11092727357 is a prime.
It is a super-2 number, since 2×110927273732 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11092727333) 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 15 ways as a sum of consecutive naturals, for example, 20316078 + ... + 20316623.
It is an arithmetic number, because the mean of its divisors is an integer number (1137715656).
Almost surely, 211092727373 is an apocalyptic number.
11092727373 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11092727373 is a deficient number, since it is larger than the sum of its proper divisors (7110723123).
11092727373 is a wasteful number, since it uses less digits than its factorization.
11092727373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40632724.
The product of its (nonzero) digits is 111132, while the sum is 42.
The spelling of 11092727373 in words is "eleven billion, ninety-two million, seven hundred twenty-seven thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •