Base | Representation |
---|---|
bin | 101100001000101… |
… | …010000011100001 |
3 | 1220121022121122111 |
4 | 230020222003201 |
5 | 3004024420123 |
6 | 201250435321 |
7 | 24230602444 |
oct | 5410520341 |
9 | 1817277574 |
10 | 740466913 |
11 | 34aa7982a |
12 | 187b92b41 |
13 | ba53a604 |
14 | 704ad65b |
15 | 4501790d |
hex | 2c22a0e1 |
740466913 has 2 divisors, whose sum is σ = 740466914. Its totient is φ = 740466912.
The previous prime is 740466901. The next prime is 740466931. The reversal of 740466913 is 319664047.
Together with next prime (740466931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 401281024 + 339185889 = 20032^2 + 18417^2 .
It is an emirp because it is prime and its reverse (319664047) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-740466913 is a prime.
It is not a weakly prime, because it can be changed into another prime (740466413) 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, 370233456 + 370233457.
It is an arithmetic number, because the mean of its divisors is an integer number (370233457).
Almost surely, 2740466913 is an apocalyptic number.
It is an amenable number.
740466913 is a deficient number, since it is larger than the sum of its proper divisors (1).
740466913 is an equidigital number, since it uses as much as digits as its factorization.
740466913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 40.
The square root of 740466913 is about 27211.5216957817. The cubic root of 740466913 is about 904.6943660306.
The spelling of 740466913 in words is "seven hundred forty million, four hundred sixty-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •