Base | Representation |
---|---|
bin | 100101100010… |
… | …0101100111101 |
3 | 1101000211222011 |
4 | 1023010230331 |
5 | 20014230221 |
6 | 1541451221 |
7 | 326164162 |
oct | 113045475 |
9 | 41024864 |
10 | 19680061 |
11 | 10121a15 |
12 | 6710b11 |
13 | 410090b |
14 | 2884069 |
15 | 1adb1e1 |
hex | 12c4b3d |
19680061 has 4 divisors (see below), whose sum is σ = 19720000. Its totient is φ = 19640124.
The previous prime is 19680053. The next prime is 19680077. The reversal of 19680061 is 16008691.
It is a happy number.
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: 16008691 = 443 ⋅36137.
It is a cyclic number.
It is not a de Polignac number, because 19680061 - 23 = 19680053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19680161) 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, 19221 + ... + 20218.
It is an arithmetic number, because the mean of its divisors is an integer number (4930000).
Almost surely, 219680061 is an apocalyptic number.
It is an amenable number.
19680061 is a deficient number, since it is larger than the sum of its proper divisors (39939).
19680061 is an equidigital number, since it uses as much as digits as its factorization.
19680061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39938.
The product of its (nonzero) digits is 2592, while the sum is 31.
The square root of 19680061 is about 4436.2214777894. The cubic root of 19680061 is about 269.9865608309.
The spelling of 19680061 in words is "nineteen million, six hundred eighty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •