Base | Representation |
---|---|
bin | 10100101010010010… |
… | …00000110001010110 |
3 | 1001122000202011202010 |
4 | 22111021000301112 |
5 | 140204034232410 |
6 | 5032354125050 |
7 | 541605212316 |
oct | 122511006126 |
9 | 31560664663 |
10 | 11092102230 |
11 | 4782225640 |
12 | 2196880786 |
13 | 107a034401 |
14 | 773207446 |
15 | 44dbd3c20 |
hex | 295240c56 |
11092102230 has 32 divisors (see below), whose sum is σ = 29041141248. Its totient is φ = 2688994400.
The previous prime is 11092102213. The next prime is 11092102253. The reversal of 11092102230 is 3220129011.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11092102197 and 11092102206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16805886 + ... + 16806545.
It is an arithmetic number, because the mean of its divisors is an integer number (907535664).
Almost surely, 211092102230 is an apocalyptic number.
11092102230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11092102230 is an abundant number, since it is smaller than the sum of its proper divisors (17949039018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11092102230 is a wasteful number, since it uses less digits than its factorization.
11092102230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33612452.
The product of its (nonzero) digits is 216, while the sum is 21.
The spelling of 11092102230 in words is "eleven billion, ninety-two million, one hundred two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •