Base | Representation |
---|---|
bin | 1111010010110110… |
… | …1011110000011011 |
3 | 101121010102220221002 |
4 | 3310231223300123 |
5 | 31402014211121 |
6 | 1515221335215 |
7 | 203512110101 |
oct | 36455536033 |
9 | 11533386832 |
10 | 4105616411 |
11 | 1817571416 |
12 | 966b6750b |
13 | 505780730 |
14 | 2ad3a7c71 |
15 | 190688e0b |
hex | f4b6bc1b |
4105616411 has 16 divisors (see below), whose sum is σ = 4482379104. Its totient is φ = 3737919744.
The previous prime is 4105616341. The next prime is 4105616423. The reversal of 4105616411 is 1146165014.
It is a happy number.
4105616411 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4105616411 - 222 = 4101422107 is a prime.
It is a super-2 number, since 2×41056164112 = 33712172228545041842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4105616611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 272276 + ... + 286958.
It is an arithmetic number, because the mean of its divisors is an integer number (280148694).
Almost surely, 24105616411 is an apocalyptic number.
4105616411 is a deficient number, since it is larger than the sum of its proper divisors (376762693).
4105616411 is a wasteful number, since it uses less digits than its factorization.
4105616411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14990.
The product of its (nonzero) digits is 2880, while the sum is 29.
The square root of 4105616411 is about 64075.0841669365. The cubic root of 4105616411 is about 1601.2511582209.
The spelling of 4105616411 in words is "four billion, one hundred five million, six hundred sixteen thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •