Base | Representation |
---|---|
bin | 1011011000100110110011110… |
… | …0101000001001111010000100 |
3 | 10220001111111001002100012120101 |
4 | 2312021230330220021322010 |
5 | 1320000401220220023413 |
6 | 11515453223335413444 |
7 | 330512242254644410 |
oct | 26611547450117204 |
9 | 3801444032305511 |
10 | 801111202111108 |
11 | 212293397736149 |
12 | 75a24874824284 |
13 | 28501601614585 |
14 | 101b7dbbddbd40 |
15 | 6293b1a3c1edd |
hex | 2d89b3ca09e84 |
801111202111108 has 48 divisors (see below), whose sum is σ = 1703248413148800. Its totient is φ = 322042767148800.
The previous prime is 801111202111057. The next prime is 801111202111189.
801111202111108 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7454639953 + ... + 7454747416.
It is an arithmetic number, because the mean of its divisors is an integer number (35484341940600).
Almost surely, 2801111202111108 is an apocalyptic number.
It is an amenable number.
801111202111108 is an abundant number, since it is smaller than the sum of its proper divisors (902137211037692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
801111202111108 is a wasteful number, since it uses less digits than its factorization.
801111202111108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14909387500 (or 14909387498 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 28.
It can be divided in two parts, 80111120 and 2111108, that added together give a palindrome (82222228).
The spelling of 801111202111108 in words is "eight hundred one trillion, one hundred eleven billion, two hundred two million, one hundred eleven thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •