Base | Representation |
---|---|
bin | 100000110100000… |
… | …0010101111011010 |
3 | 2211201202102001100 |
4 | 1001220002233122 |
5 | 4223330003101 |
6 | 301130332230 |
7 | 36166324155 |
oct | 10150025732 |
9 | 2751672040 |
10 | 1101016026 |
11 | 515549700 |
12 | 26888a076 |
13 | 147148296 |
14 | a6324c9c |
15 | 669d6e86 |
hex | 41a02bda |
1101016026 has 144 divisors (see below), whose sum is σ = 2828367360. Its totient is φ = 308404800.
The previous prime is 1101016019. The next prime is 1101016061. The reversal of 1101016026 is 6206101011.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1552560 + ... + 1553268.
It is an arithmetic number, because the mean of its divisors is an integer number (19641440).
Almost surely, 21101016026 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1101016026, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1414183680).
1101016026 is an abundant number, since it is smaller than the sum of its proper divisors (1727351334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101016026 is a wasteful number, since it uses less digits than its factorization.
1101016026 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 793 (or 779 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The square root of 1101016026 is about 33181.5615364919. The cubic root of 1101016026 is about 1032.5978429362.
Adding to 1101016026 its reverse (6206101011), we get a palindrome (7307117037).
The spelling of 1101016026 in words is "one billion, one hundred one million, sixteen thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •