Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …0110011001110001110100 |
3 | 1102222112222210121100111120 |
4 | 2200031331012121301310 |
5 | 2420342141100310400 |
6 | 35225545313503540 |
7 | 2214311353642032 |
oct | 240157506316164 |
9 | 42875883540446 |
10 | 11010100010100 |
11 | 35653a2471aa4 |
12 | 12999b8271bb0 |
13 | 61b32ba597a9 |
14 | 2a0c6aacd552 |
15 | 1415e821eca0 |
hex | a037d199c74 |
11010100010100 has 72 divisors (see below), whose sum is σ = 33532515135840. Its totient is φ = 2781498948480.
The previous prime is 11010100010047. The next prime is 11010100010111. The reversal of 11010100010100 is 101000101011.
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 polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 965792547 + ... + 965803946.
Almost surely, 211010100010100 is an apocalyptic number.
11010100010100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010100010100 is an abundant number, since it is smaller than the sum of its proper divisors (22522415125740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010100010100 is a wasteful number, since it uses less digits than its factorization.
11010100010100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1931596529 (or 1931596522 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 11010100010100 its reverse (101000101011), we get a palindrome (11111100111111).
It can be divided in two parts, 1 and 1010100010100, that added together give a palindrome (1010100010101).
The spelling of 11010100010100 in words is "eleven trillion, ten billion, one hundred million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •