Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …0101010110110011100010 |
3 | 1110022011022010112222210100 |
4 | 2201201301211112303202 |
5 | 2423331001341023020 |
6 | 35335152133443230 |
7 | 2223645565452162 |
oct | 241416145266342 |
9 | 43264263488710 |
10 | 11100101111010 |
11 | 359a58777522a |
12 | 12b33354a0516 |
13 | 626972b75ba2 |
14 | 2a5367bd65a2 |
15 | 143b14717a90 |
hex | a1871956ce2 |
11100101111010 has 48 divisors (see below), whose sum is σ = 29640270002616. Its totient is φ = 2880026233344.
The previous prime is 11100101111003. The next prime is 11100101111051. The reversal of 11100101111010 is 1011110100111.
It can be written as a sum of positive squares in 4 ways, for example, as 11062601950401 + 37499160609 = 3326049^2 + 193647^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11100101110983 and 11100101111001.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1666678519 + ... + 1666685178.
Almost surely, 211100101111010 is an apocalyptic number.
11100101111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11100101111010 is an abundant number, since it is smaller than the sum of its proper divisors (18540168891606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100101111010 is a wasteful number, since it uses less digits than its factorization.
11100101111010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3333363747 (or 3333363744 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11100101111010 its reverse (1011110100111), we get a palindrome (12111211211121).
The spelling of 11100101111010 in words is "eleven trillion, one hundred billion, one hundred one million, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •