Base | Representation |
---|---|
bin | 100101011010000110… |
… | …111010001000110111 |
3 | 10211200021021220001201 |
4 | 211122012322020313 |
5 | 1124230103403403 |
6 | 30241402433331 |
7 | 2621235220501 |
oct | 453206721067 |
9 | 124607256051 |
10 | 40166466103 |
11 | 16041a17535 |
12 | 794b802847 |
13 | 3a316c820a |
14 | 1d30740d71 |
15 | 10a141a21d |
hex | 95a1ba237 |
40166466103 has 8 divisors (see below), whose sum is σ = 40948934400. Its totient is φ = 39384909408.
The previous prime is 40166466097. The next prime is 40166466107. The reversal of 40166466103 is 30166466104.
40166466103 is digitally balanced in base 2, because in such base 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-40166466103 is a prime.
It is a super-2 number, since 2×401664661032 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40166466107) 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, 138583 + ... + 315496.
It is an arithmetic number, because the mean of its divisors is an integer number (5118616800).
Almost surely, 240166466103 is an apocalyptic number.
40166466103 is a deficient number, since it is larger than the sum of its proper divisors (782468297).
40166466103 is a wasteful number, since it uses less digits than its factorization.
40166466103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 455801.
The product of its (nonzero) digits is 62208, while the sum is 37.
Subtracting from 40166466103 its reverse (30166466104), we obtain a palindrome (9999999999).
The spelling of 40166466103 in words is "forty billion, one hundred sixty-six million, four hundred sixty-six thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •