Base | Representation |
---|---|
bin | 100100001100100… |
… | …001000101010101 |
3 | 1120022200001111122 |
4 | 210030201011111 |
5 | 2220424323023 |
6 | 140131413325 |
7 | 21022430162 |
oct | 4414410525 |
9 | 1508601448 |
10 | 607261013 |
11 | 291868207 |
12 | 14b454245 |
13 | 98a6b858 |
14 | 5a917069 |
15 | 384a42c8 |
hex | 24321155 |
607261013 has 2 divisors, whose sum is σ = 607261014. Its totient is φ = 607261012.
The previous prime is 607260991. The next prime is 607261051. The reversal of 607261013 is 310162706.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 592338244 + 14922769 = 24338^2 + 3863^2 .
It is a cyclic number.
It is not a de Polignac number, because 607261013 - 220 = 606212437 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p31684103 and since 607261013 and 31684103 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (607261813) 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, 303630506 + 303630507.
It is an arithmetic number, because the mean of its divisors is an integer number (303630507).
Almost surely, 2607261013 is an apocalyptic number.
It is an amenable number.
607261013 is a deficient number, since it is larger than the sum of its proper divisors (1).
607261013 is an equidigital number, since it uses as much as digits as its factorization.
607261013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 26.
The square root of 607261013 is about 24642.6665156188. Note that the first 3 decimals coincide. The cubic root of 607261013 is about 846.8213519807.
The spelling of 607261013 in words is "six hundred seven million, two hundred sixty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •