Base | Representation |
---|---|
bin | 10100100010111010… |
… | …01011011001110100 |
3 | 1001110201102021022100 |
4 | 22101131023121310 |
5 | 140042222423141 |
6 | 5022305102100 |
7 | 540224555064 |
oct | 122135133164 |
9 | 31421367270 |
10 | 11030279796 |
11 | 475033a518 |
12 | 217a027930 |
13 | 106a299aa3 |
14 | 768d133a4 |
15 | 4485710b6 |
hex | 29174b674 |
11030279796 has 144 divisors (see below), whose sum is σ = 29889699840. Its totient is φ = 3417738240.
The previous prime is 11030279773. The next prime is 11030279803. The reversal of 11030279796 is 69797203011.
11030279796 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 23027485 + ... + 23027963.
It is an arithmetic number, because the mean of its divisors is an integer number (207567360).
Almost surely, 211030279796 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 11030279796, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14944849920).
11030279796 is an abundant number, since it is smaller than the sum of its proper divisors (18859420044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11030279796 is a wasteful number, since it uses less digits than its factorization.
11030279796 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 894 (or 889 counting only the distinct ones).
The product of its (nonzero) digits is 142884, while the sum is 45.
The spelling of 11030279796 in words is "eleven billion, thirty million, two hundred seventy-nine thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •