Base | Representation |
---|---|
bin | 100101101000101110… |
… | …010001011010110111 |
3 | 10212022100200100020012 |
4 | 211220232101122313 |
5 | 1130230341303403 |
6 | 30322002130435 |
7 | 2630303331344 |
oct | 455056213267 |
9 | 125270610205 |
10 | 40411666103 |
11 | 16158371966 |
12 | 79b9950a1b |
13 | 3a70449b83 |
14 | 1d5512b7cb |
15 | 10b7c01ed8 |
hex | 968b916b7 |
40411666103 has 8 divisors (see below), whose sum is σ = 42387190368. Its totient is φ = 38454349824.
The previous prime is 40411666073. The next prime is 40411666133. The reversal of 40411666103 is 30166611404.
It is an interprime number because it is at equal distance from previous prime (40411666073) and next prime (40411666133).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40411666103 - 222 = 40407471799 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40411666103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40411666133) 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 7 ways as a sum of consecutive naturals, for example, 4547450 + ... + 4556327.
It is an arithmetic number, because the mean of its divisors is an integer number (5298398796).
Almost surely, 240411666103 is an apocalyptic number.
40411666103 is a deficient number, since it is larger than the sum of its proper divisors (1975524265).
40411666103 is a wasteful number, since it uses less digits than its factorization.
40411666103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9103993.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 40411666103 in words is "forty billion, four hundred eleven million, six hundred sixty-six thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •