Base | Representation |
---|---|
bin | 1000100101100010… |
… | …11100000010000001 |
3 | 102220021101001100210 |
4 | 10102301130002001 |
5 | 33420114321212 |
6 | 2041234304333 |
7 | 222144435264 |
oct | 42261340201 |
9 | 12807331323 |
10 | 4609917057 |
11 | 1a561a5a09 |
12 | a87a280a9 |
13 | 5860b0195 |
14 | 31a35ccdb |
15 | 1beaa153c |
hex | 112c5c081 |
4609917057 has 4 divisors (see below), whose sum is σ = 6146556080. Its totient is φ = 3073278036.
The previous prime is 4609917049. The next prime is 4609917073. The reversal of 4609917057 is 7507199064.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 4609917057 - 23 = 4609917049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4609916997 and 4609917015.
It is not an unprimeable number, because it can be changed into a prime (4609917007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 768319507 + ... + 768319512.
It is an arithmetic number, because the mean of its divisors is an integer number (1536639020).
Almost surely, 24609917057 is an apocalyptic number.
It is an amenable number.
4609917057 is a deficient number, since it is larger than the sum of its proper divisors (1536639023).
4609917057 is a wasteful number, since it uses less digits than its factorization.
4609917057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1536639022.
The product of its (nonzero) digits is 476280, while the sum is 48.
The square root of 4609917057 is about 67896.3699839690. The cubic root of 4609917057 is about 1664.2977926077.
The spelling of 4609917057 in words is "four billion, six hundred nine million, nine hundred seventeen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •