Base | Representation |
---|---|
bin | 1001000110000111100110110… |
… | …0101110001010011011010101 |
3 | 10002221012211201220200012221212 |
4 | 2101201321230232022123111 |
5 | 1132343010102222101143 |
6 | 10145133135304151205 |
7 | 251546554313403365 |
oct | 22141715456123325 |
9 | 3087184656605855 |
10 | 640046440425173 |
11 | 175a36197709891 |
12 | 5b951355a68505 |
13 | 2161a1745491c2 |
14 | b40a5ad40c9a5 |
15 | 4dee124005918 |
hex | 2461e6cb8a6d5 |
640046440425173 has 2 divisors, whose sum is σ = 640046440425174. Its totient is φ = 640046440425172.
The previous prime is 640046440425089. The next prime is 640046440425181. The reversal of 640046440425173 is 371524044640046.
640046440425173 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 630368629622449 + 9677810802724 = 25107143^2 + 3110918^2 .
It is a cyclic number.
It is not a de Polignac number, because 640046440425173 - 222 = 640046436230869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (640046440428173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320023220212586 + 320023220212587.
It is an arithmetic number, because the mean of its divisors is an integer number (320023220212587).
Almost surely, 2640046440425173 is an apocalyptic number.
It is an amenable number.
640046440425173 is a deficient number, since it is larger than the sum of its proper divisors (1).
640046440425173 is an equidigital number, since it uses as much as digits as its factorization.
640046440425173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7741440, while the sum is 50.
The spelling of 640046440425173 in words is "six hundred forty trillion, forty-six billion, four hundred forty million, four hundred twenty-five thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •