Base | Representation |
---|---|
bin | 1010000000010010001100… |
… | …0110010101111000010100 |
3 | 1102221120220220212021100012 |
4 | 2200010203012111320110 |
5 | 2420211000012010400 |
6 | 35221155201535352 |
7 | 2213503154132321 |
oct | 240044306257024 |
9 | 42846826767305 |
10 | 11000000110100 |
11 | 356108a324701 |
12 | 1297a59944558 |
13 | 61a3ac4621c1 |
14 | 2a058d5a3b48 |
15 | 1412066cbd35 |
hex | a0123195e14 |
11000000110100 has 36 divisors (see below), whose sum is σ = 23877504859068. Its totient is φ = 4398616704000.
The previous prime is 11000000110069. The next prime is 11000000110171. The reversal of 11000000110100 is 101100000011.
It can be written as a sum of positive squares in 6 ways, for example, as 160220876176 + 10839779233924 = 400276^2 + 3292382^2 .
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16972061 + ... + 17608260.
It is an arithmetic number, because the mean of its divisors is an integer number (663264023863).
Almost surely, 211000000110100 is an apocalyptic number.
11000000110100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11000000110100 is an abundant number, since it is smaller than the sum of its proper divisors (12877504748968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000000110100 is a wasteful number, since it uses less digits than its factorization.
11000000110100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34583516 (or 34583509 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 11000000110100 its reverse (101100000011), we get a palindrome (11101100110111).
The spelling of 11000000110100 in words is "eleven trillion, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •