Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …101100011110010010100 |
3 | 10220011022121002102011220 |
4 | 100000131231203302110 |
5 | 121010310042010400 |
6 | 2201200534130340 |
7 | 142321163443026 |
oct | 20003555436224 |
9 | 3804277072156 |
10 | 1100010110100 |
11 | 39456a036950 |
12 | 1592331b09b0 |
13 | 7c965c07c95 |
14 | 3b35297a016 |
15 | 1d9317eb7a0 |
hex | 1001db63c94 |
1100010110100 has 144 divisors (see below), whose sum is σ = 3584033273856. Its totient is φ = 258066864000.
The previous prime is 1100010110099. The next prime is 1100010110197. The reversal of 1100010110100 is 10110100011.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
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 47 ways as a sum of consecutive naturals, for example, 5274094 + ... + 5478693.
Almost surely, 21100010110100 is an apocalyptic number.
1100010110100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100010110100 is an abundant number, since it is smaller than the sum of its proper divisors (2484023163756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100010110100 is a wasteful number, since it uses less digits than its factorization.
1100010110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10752846 (or 10752839 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1100010110100 its reverse (10110100011), we get a palindrome (1110120210111).
The spelling of 1100010110100 in words is "one trillion, one hundred billion, ten million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •