Base | Representation |
---|---|
bin | 10100011111100100… |
… | …11111000111000110 |
3 | 1001101202210022111002 |
4 | 22033302133013012 |
5 | 140013042423420 |
6 | 5015425413302 |
7 | 536435046530 |
oct | 121762370706 |
9 | 31352708432 |
10 | 11002311110 |
11 | 47365771aa |
12 | 217079a232 |
13 | 106455657b |
14 | 765312850 |
15 | 445d99075 |
hex | 28fc9f1c6 |
11002311110 has 32 divisors (see below), whose sum is σ = 22690393920. Its totient is φ = 3762709632.
The previous prime is 11002311013. The next prime is 11002311139. The reversal of 11002311110 is 1111320011.
It is a happy number.
It is a super-2 number, since 2×110023111102 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11002311091 and 11002311100.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 170165 + ... + 225744.
It is an arithmetic number, because the mean of its divisors is an integer number (709074810).
Almost surely, 211002311110 is an apocalyptic number.
11002311110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11002311110 is an abundant number, since it is smaller than the sum of its proper divisors (11688082810).
11002311110 is a wasteful number, since it uses less digits than its factorization.
11002311110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396320.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 11002311110 its reverse (1111320011), we get a palindrome (12113631121).
The spelling of 11002311110 in words is "eleven billion, two million, three hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •