Base | Representation |
---|---|
bin | 10100101011110101… |
… | …10001011101001101 |
3 | 1001122221021220101200 |
4 | 22111322301131031 |
5 | 140220404143301 |
6 | 5033541500113 |
7 | 542124121665 |
oct | 122572613515 |
9 | 31587256350 |
10 | 11105146701 |
11 | 47896250a0 |
12 | 219b111639 |
13 | 107c95092c |
14 | 774c411a5 |
15 | 44ee0dc86 |
hex | 295eb174d |
11105146701 has 24 divisors (see below), whose sum is σ = 17504906016. Its totient is φ = 6728127840.
The previous prime is 11105146673. The next prime is 11105146721. The reversal of 11105146701 is 10764150111.
It is not a de Polignac number, because 11105146701 - 25 = 11105146669 is a prime.
It is a super-3 number, since 3×111051467013 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11105146721) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 304806 + ... + 339288.
It is an arithmetic number, because the mean of its divisors is an integer number (729371084).
Almost surely, 211105146701 is an apocalyptic number.
11105146701 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11105146701 is a deficient number, since it is larger than the sum of its proper divisors (6399759315).
11105146701 is a wasteful number, since it uses less digits than its factorization.
11105146701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37753 (or 37750 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 27.
Adding to 11105146701 its reverse (10764150111), we get a palindrome (21869296812).
The spelling of 11105146701 in words is "eleven billion, one hundred five million, one hundred forty-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •