Base | Representation |
---|---|
bin | 100101011010000101… |
… | …010010100000001101 |
3 | 10211200020111022202212 |
4 | 211122011102200031 |
5 | 1124230001312423 |
6 | 30241345400205 |
7 | 2621231502065 |
oct | 453205224015 |
9 | 124606438685 |
10 | 40166041613 |
11 | 16041757615 |
12 | 794b639065 |
13 | 3a315a9c39 |
14 | 1d306703a5 |
15 | 10a1384578 |
hex | 95a15280d |
40166041613 has 8 divisors (see below), whose sum is σ = 41104896096. Its totient is φ = 39227403600.
The previous prime is 40166041589. The next prime is 40166041631. The reversal of 40166041613 is 31614066104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40166041613 - 222 = 40161847309 is a prime.
It is a super-2 number, since 2×401660416132 (a number of 22 digits) contains 22 as substring.
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 40166041613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40166041313) 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, 357458 + ... + 456188.
It is an arithmetic number, because the mean of its divisors is an integer number (5138112012).
Almost surely, 240166041613 is an apocalyptic number.
40166041613 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
40166041613 is a deficient number, since it is larger than the sum of its proper divisors (938854483).
40166041613 is an equidigital number, since it uses as much as digits as its factorization.
40166041613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108235.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 40166041613 in words is "forty billion, one hundred sixty-six million, forty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •