Base | Representation |
---|---|
bin | 10100100001101100… |
… | …10110011110000000 |
3 | 1001110000021011022120 |
4 | 22100312112132000 |
5 | 140032121222004 |
6 | 5021303004240 |
7 | 540042213546 |
oct | 122066263600 |
9 | 31400234276 |
10 | 11020101504 |
11 | 4745618405 |
12 | 2176739680 |
13 | 1068145029 |
14 | 767823d96 |
15 | 4477103d9 |
hex | 290d96780 |
11020101504 has 128 divisors (see below), whose sum is σ = 30659731200. Its totient is φ = 3500445696.
The previous prime is 11020101503. The next prime is 11020101523. The reversal of 11020101504 is 40510102011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020101503) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2497252 + ... + 2501660.
It is an arithmetic number, because the mean of its divisors is an integer number (239529150).
Almost surely, 211020101504 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11020101504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15329865600).
11020101504 is an abundant number, since it is smaller than the sum of its proper divisors (19639629696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020101504 is a wasteful number, since it uses less digits than its factorization.
11020101504 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4732 (or 4720 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 15.
Adding to 11020101504 its reverse (40510102011), we get a palindrome (51530203515).
The spelling of 11020101504 in words is "eleven billion, twenty million, one hundred one thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •