Base | Representation |
---|---|
bin | 1001001001010001… |
… | …01000000110000101 |
3 | 110200011021101001012 |
4 | 10210220220012011 |
5 | 40023324101221 |
6 | 2131101412005 |
7 | 232443613025 |
oct | 44450500605 |
9 | 13604241035 |
10 | 4909597061 |
11 | 209a380a36 |
12 | b5026a005 |
13 | 6031c8425 |
14 | 34808ba85 |
15 | 1db04a65b |
hex | 124a28185 |
4909597061 has 2 divisors, whose sum is σ = 4909597062. Its totient is φ = 4909597060.
The previous prime is 4909597051. The next prime is 4909597097. The reversal of 4909597061 is 1607959094.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4652604100 + 256992961 = 68210^2 + 16031^2 .
It is a cyclic number.
It is not a de Polignac number, because 4909597061 - 210 = 4909596037 is a prime.
It is a super-3 number, since 3×49095970613 (a number of 30 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4909597051) 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 as a sum of consecutive naturals, namely, 2454798530 + 2454798531.
It is an arithmetic number, because the mean of its divisors is an integer number (2454798531).
Almost surely, 24909597061 is an apocalyptic number.
It is an amenable number.
4909597061 is a deficient number, since it is larger than the sum of its proper divisors (1).
4909597061 is an equidigital number, since it uses as much as digits as its factorization.
4909597061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 612360, while the sum is 50.
The square root of 4909597061 is about 70068.5169030999. The cubic root of 4909597061 is about 1699.6074134980.
The spelling of 4909597061 in words is "four billion, nine hundred nine million, five hundred ninety-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •