Base | Representation |
---|---|
bin | 111010011101011… |
… | …1011010010100001 |
3 | 12001201002211011112 |
4 | 1310322323102201 |
5 | 13004132314012 |
6 | 522351553105 |
7 | 66416234564 |
oct | 16472732241 |
9 | 5051084145 |
10 | 1961604257 |
11 | 917302348 |
12 | 468b2b795 |
13 | 253522aa2 |
14 | 1487424db |
15 | b732b122 |
hex | 74ebb4a1 |
1961604257 has 4 divisors (see below), whose sum is σ = 1972563120. Its totient is φ = 1950645396.
The previous prime is 1961604217. The next prime is 1961604263. The reversal of 1961604257 is 7524061691.
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 1961604257 - 26 = 1961604193 is a prime.
It is a super-2 number, since 2×19616042572 = 7695782522161044098, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1961604217) 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, 5479163 + ... + 5479520.
It is an arithmetic number, because the mean of its divisors is an integer number (493140780).
Almost surely, 21961604257 is an apocalyptic number.
It is an amenable number.
1961604257 is a deficient number, since it is larger than the sum of its proper divisors (10958863).
1961604257 is a wasteful number, since it uses less digits than its factorization.
1961604257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10958862.
The product of its (nonzero) digits is 90720, while the sum is 41.
The square root of 1961604257 is about 44290.0017724091. The cubic root of 1961604257 is about 1251.8062967364.
The spelling of 1961604257 in words is "one billion, nine hundred sixty-one million, six hundred four thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •