Base | Representation |
---|---|
bin | 100111101100001000… |
… | …001000000001110001 |
3 | 11002000000000020200212 |
4 | 213230020020001301 |
5 | 1144234230234143 |
6 | 31324434153505 |
7 | 3036033136052 |
oct | 475410100161 |
9 | 132000006625 |
10 | 42616258673 |
11 | 1708984899a |
12 | 8314122895 |
13 | 40320c8a11 |
14 | 20c3c42729 |
15 | 1196529918 |
hex | 9ec208071 |
42616258673 has 2 divisors, whose sum is σ = 42616258674. Its totient is φ = 42616258672.
The previous prime is 42616258667. The next prime is 42616258679. The reversal of 42616258673 is 37685261624.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (42616258667) and next prime (42616258679).
It can be written as a sum of positive squares in only one way, i.e., 37565029489 + 5051229184 = 193817^2 + 71072^2 .
It is a cyclic number.
It is not a de Polignac number, because 42616258673 - 26 = 42616258609 is a prime.
It is a super-2 number, since 2×426162586732 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (42616258679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21308129336 + 21308129337.
It is an arithmetic number, because the mean of its divisors is an integer number (21308129337).
Almost surely, 242616258673 is an apocalyptic number.
It is an amenable number.
42616258673 is a deficient number, since it is larger than the sum of its proper divisors (1).
42616258673 is an equidigital number, since it uses as much as digits as its factorization.
42616258673 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2903040, while the sum is 50.
The spelling of 42616258673 in words is "forty-two billion, six hundred sixteen million, two hundred fifty-eight thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •