Base | Representation |
---|---|
bin | 111110000000011101110… |
… | …001011101000101100011 |
3 | 120002100122212200201111102 |
4 | 332000131301131011203 |
5 | 1024303221401423331 |
6 | 13021305304305015 |
7 | 616566130260146 |
oct | 76003561350543 |
9 | 16070585621442 |
10 | 4261107061091 |
11 | 13a3141938251 |
12 | 5899b817216b |
13 | 24ba8902870a |
14 | 10a34ad3005d |
15 | 75c93e604cb |
hex | 3e01dc5d163 |
4261107061091 has 8 divisors (see below), whose sum is σ = 4486982995200. Its totient is φ = 4035391841160.
The previous prime is 4261107061051. The next prime is 4261107061121. The reversal of 4261107061091 is 1901607011624.
It is a happy number.
4261107061091 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4261107061091 is a prime.
It is a super-2 number, since 2×42611070610912 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4261107061051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40124111 + ... + 40230168.
It is an arithmetic number, because the mean of its divisors is an integer number (560872874400).
Almost surely, 24261107061091 is an apocalyptic number.
4261107061091 is a deficient number, since it is larger than the sum of its proper divisors (225875934109).
4261107061091 is a wasteful number, since it uses less digits than its factorization.
4261107061091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80357089.
The product of its (nonzero) digits is 18144, while the sum is 38.
The spelling of 4261107061091 in words is "four trillion, two hundred sixty-one billion, one hundred seven million, sixty-one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •