Base | Representation |
---|---|
bin | 111010100110100… |
… | …0101000110110001 |
3 | 12002001001121000101 |
4 | 1311031011012301 |
5 | 13011342104212 |
6 | 523041552401 |
7 | 66504544621 |
oct | 16515050661 |
9 | 5061047011 |
10 | 1966363057 |
11 | 919a6273a |
12 | 46a645701 |
13 | 2544cab49 |
14 | 149220881 |
15 | b796b157 |
hex | 753451b1 |
1966363057 has 4 divisors (see below), whose sum is σ = 1969646400. Its totient is φ = 1963079716.
The previous prime is 1966363031. The next prime is 1966363079. The reversal of 1966363057 is 7503636691.
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: 7503636691 = 1789 ⋅4194319.
It is a cyclic number.
It is not a de Polignac number, because 1966363057 - 211 = 1966361009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1966362998 and 1966363016.
It is not an unprimeable number, because it can be changed into a prime (1966363457) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1640773 + ... + 1641970.
It is an arithmetic number, because the mean of its divisors is an integer number (492411600).
Almost surely, 21966363057 is an apocalyptic number.
It is an amenable number.
1966363057 is a deficient number, since it is larger than the sum of its proper divisors (3283343).
1966363057 is an equidigital number, since it uses as much as digits as its factorization.
1966363057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3283342.
The product of its (nonzero) digits is 612360, while the sum is 46.
The square root of 1966363057 is about 44343.6924150437. The cubic root of 1966363057 is about 1252.8177622267.
The spelling of 1966363057 in words is "one billion, nine hundred sixty-six million, three hundred sixty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •