Base | Representation |
---|---|
bin | 10100101100110011… |
… | …11111100110011101 |
3 | 1001200111200201021121 |
4 | 22112121333212131 |
5 | 140230003043401 |
6 | 5034433130541 |
7 | 542253520135 |
oct | 122631774635 |
9 | 31614621247 |
10 | 11113331101 |
11 | 4793205164 |
12 | 21a19b9a51 |
13 | 1081557c82 |
14 | 775d71ac5 |
15 | 4509c8ca1 |
hex | 29667f99d |
11113331101 has 8 divisors (see below), whose sum is σ = 11161193400. Its totient is φ = 11065528320.
The previous prime is 11113331057. The next prime is 11113331147. The reversal of 11113331101 is 10113331111.
It can be written as a sum of positive squares in 4 ways, for example, as 45239076 + 11068092025 = 6726^2 + 105205^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11113331101 - 211 = 11113329053 is a prime.
It is a super-2 number, since 2×111133311012 (a number of 21 digits) contains 22 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 (11113334101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 381895 + ... + 409963.
It is an arithmetic number, because the mean of its divisors is an integer number (1395149175).
Almost surely, 211113331101 is an apocalyptic number.
It is an amenable number.
11113331101 is a deficient number, since it is larger than the sum of its proper divisors (47862299).
11113331101 is a wasteful number, since it uses less digits than its factorization.
11113331101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29759.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 11113331101 its reverse (10113331111), we get a palindrome (21226662212).
The spelling of 11113331101 in words is "eleven billion, one hundred thirteen million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •