Base | Representation |
---|---|
bin | 10101001111000111… |
… | …10000001100011110 |
3 | 1002102120011222220010 |
4 | 22213203300030132 |
5 | 141322140231420 |
6 | 5123153104050 |
7 | 552346524516 |
oct | 124743601436 |
9 | 32376158803 |
10 | 11401102110 |
11 | 4920696842 |
12 | 2262258026 |
13 | 10c9063788 |
14 | 7a2280846 |
15 | 46adbe4e0 |
hex | 2a78f031e |
11401102110 has 32 divisors (see below), whose sum is σ = 27366261120. Its totient is φ = 3039892128.
The previous prime is 11401102091. The next prime is 11401102129. The reversal of 11401102110 is 1120110411.
11401102110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11401102091) and next prime (11401102129).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 258021 + ... + 298959.
It is an arithmetic number, because the mean of its divisors is an integer number (855195660).
Almost surely, 211401102110 is an apocalyptic number.
11401102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11401102110 is an abundant number, since it is smaller than the sum of its proper divisors (15965159010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11401102110 is a wasteful number, since it uses less digits than its factorization.
11401102110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50232.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11401102110 its reverse (1120110411), we get a palindrome (12521212521).
The spelling of 11401102110 in words is "eleven billion, four hundred one million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •