Base | Representation |
---|---|
bin | 10100101110111101… |
… | …00101101111010110 |
3 | 1001201202112021221221 |
4 | 22113132211233112 |
5 | 140244104004420 |
6 | 5040314400554 |
7 | 542562412621 |
oct | 122736455726 |
9 | 31652467857 |
10 | 11131313110 |
11 | 47a2377325 |
12 | 21a7a3015a |
13 | 10851b2a08 |
14 | 7784d2db8 |
15 | 45237bcaa |
hex | 2977a5bd6 |
11131313110 has 8 divisors (see below), whose sum is σ = 20036363616. Its totient is φ = 4452525240.
The previous prime is 11131313101. The next prime is 11131313117. The reversal of 11131313110 is 1131313111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×111313131102 (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 (11131313117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 556565646 + ... + 556565665.
It is an arithmetic number, because the mean of its divisors is an integer number (2504545452).
Almost surely, 211131313110 is an apocalyptic number.
11131313110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11131313110 is a deficient number, since it is larger than the sum of its proper divisors (8905050506).
11131313110 is a wasteful number, since it uses less digits than its factorization.
11131313110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1113131318.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 11131313110 its reverse (1131313111), we get a palindrome (12262626221).
Subtracting from 11131313110 its reverse (1131313111), we obtain a palindrome (9999999999).
The spelling of 11131313110 in words is "eleven billion, one hundred thirty-one million, three hundred thirteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •