Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1100101111110110110100 |
3 | 1102222112201220022122000220 |
4 | 2200031313030233312310 |
5 | 2420341440224310400 |
6 | 35225531415534340 |
7 | 2214306042313221 |
oct | 240156714576664 |
9 | 42875656278026 |
10 | 11010001010100 |
11 | 35653515a3914 |
12 | 129998b08a3b0 |
13 | 61b3143a6201 |
14 | 2a0c5b8bc948 |
15 | 1415de6b67a0 |
hex | a037732fdb4 |
11010001010100 has 72 divisors (see below), whose sum is σ = 31866012507168. Its totient is φ = 2935040860800.
The previous prime is 11010001010059. The next prime is 11010001010159. The reversal of 11010001010100 is 101010001011.
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, 5076474 + ... + 6913073.
It is an arithmetic number, because the mean of its divisors is an integer number (442583507044).
Almost surely, 211010001010100 is an apocalyptic number.
11010001010100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010001010100 is an abundant number, since it is smaller than the sum of its proper divisors (20856011497068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010001010100 is a wasteful number, since it uses less digits than its factorization.
11010001010100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11992625 (or 11992618 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 11010001010100 its reverse (101010001011), we get a palindrome (11111011011111).
The spelling of 11010001010100 in words is "eleven trillion, ten billion, one million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •