Base | Representation |
---|---|
bin | 100101110111100001… |
… | …110001010101000101 |
3 | 10212221200001102000002 |
4 | 211313201301111011 |
5 | 1131232433002143 |
6 | 30402353531045 |
7 | 2636410461404 |
oct | 456741612505 |
9 | 125850042002 |
10 | 40660047173 |
11 | 1627559a279 |
12 | 7a68b73a85 |
13 | 3aaca43715 |
14 | 1d7a10563b |
15 | 10ce9165b8 |
hex | 977871545 |
40660047173 has 2 divisors, whose sum is σ = 40660047174. Its totient is φ = 40660047172.
The previous prime is 40660047137. The next prime is 40660047179. The reversal of 40660047173 is 37174006604.
40660047173 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (40660047137) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30823771489 + 9836275684 = 175567^2 + 99178^2 .
It is a cyclic number.
It is not a de Polignac number, because 40660047173 - 212 = 40660043077 is a prime.
It is a super-2 number, since 2×406600471732 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40660047179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20330023586 + 20330023587.
It is an arithmetic number, because the mean of its divisors is an integer number (20330023587).
Almost surely, 240660047173 is an apocalyptic number.
It is an amenable number.
40660047173 is a deficient number, since it is larger than the sum of its proper divisors (1).
40660047173 is an equidigital number, since it uses as much as digits as its factorization.
40660047173 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84672, while the sum is 38.
The spelling of 40660047173 in words is "forty billion, six hundred sixty million, forty-seven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •