Base | Representation |
---|---|
bin | 101010000010101… |
… | …011000010101101 |
3 | 1211011020011121022 |
4 | 222002223002231 |
5 | 2421031444121 |
6 | 153553543525 |
7 | 23323215341 |
oct | 5202530255 |
9 | 1734204538 |
10 | 705343661 |
11 | 33216a150 |
12 | 178274ba5 |
13 | b3190719 |
14 | 69969621 |
15 | 41dcaaab |
hex | 2a0ab0ad |
705343661 has 4 divisors (see below), whose sum is σ = 769465824. Its totient is φ = 641221500.
The previous prime is 705343657. The next prime is 705343673. The reversal of 705343661 is 166343507.
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 a cyclic number.
It is not a de Polignac number, because 705343661 - 22 = 705343657 is a prime.
It is a super-2 number, since 2×7053436612 = 995019360225765842, which contains 22 as substring.
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 (705343621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32061065 + ... + 32061086.
It is an arithmetic number, because the mean of its divisors is an integer number (192366456).
Almost surely, 2705343661 is an apocalyptic number.
It is an amenable number.
705343661 is a deficient number, since it is larger than the sum of its proper divisors (64122163).
705343661 is a wasteful number, since it uses less digits than its factorization.
705343661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64122162.
The product of its (nonzero) digits is 45360, while the sum is 35.
The square root of 705343661 is about 26558.3068172653. The cubic root of 705343661 is about 890.1576377762.
The spelling of 705343661 in words is "seven hundred five million, three hundred forty-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •