Base | Representation |
---|---|
bin | 100111010111011… |
… | …110011100000101 |
3 | 1201000210010012222 |
4 | 213113132130011 |
5 | 2323034343123 |
6 | 145312022125 |
7 | 22236602066 |
oct | 4727363405 |
9 | 1630703188 |
10 | 660465413 |
11 | 3098a7493 |
12 | 165231945 |
13 | a6aa964a |
14 | 63a0656d |
15 | 3ceb36c8 |
hex | 275de705 |
660465413 has 4 divisors (see below), whose sum is σ = 662589408. Its totient is φ = 658341420.
The previous prime is 660465389. The next prime is 660465467. The reversal of 660465413 is 314564066.
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, and also an emirpimes, since its reverse is a distinct semiprime: 314564066 = 2 ⋅157282033.
It is a cyclic number.
It is not a de Polignac number, because 660465413 - 26 = 660465349 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (660465473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1061531 + ... + 1062152.
It is an arithmetic number, because the mean of its divisors is an integer number (165647352).
Almost surely, 2660465413 is an apocalyptic number.
It is an amenable number.
660465413 is a deficient number, since it is larger than the sum of its proper divisors (2123995).
660465413 is a wasteful number, since it uses less digits than its factorization.
660465413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2123994.
The product of its (nonzero) digits is 51840, while the sum is 35.
The square root of 660465413 is about 25699.5216492448. The cubic root of 660465413 is about 870.8633755306.
The spelling of 660465413 in words is "six hundred sixty million, four hundred sixty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •