Base | Representation |
---|---|
bin | 111010011011111… |
… | …1010011010001101 |
3 | 12001122121200102221 |
4 | 1310313322122031 |
5 | 13003432023341 |
6 | 522323015341 |
7 | 66406434352 |
oct | 16467723215 |
9 | 5048550387 |
10 | 1960814221 |
11 | 916912823 |
12 | 46880a551 |
13 | 253307302 |
14 | 1485b8629 |
15 | b7221ed1 |
hex | 74dfa68d |
1960814221 has 4 divisors (see below), whose sum is σ = 2076156252. Its totient is φ = 1845472192.
The previous prime is 1960814183. The next prime is 1960814249. The reversal of 1960814221 is 1224180691.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1779911721 + 180902500 = 42189^2 + 13450^2 .
It is a cyclic number.
It is not a de Polignac number, because 1960814221 - 29 = 1960813709 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 (1960814021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57670990 + ... + 57671023.
It is an arithmetic number, because the mean of its divisors is an integer number (519039063).
Almost surely, 21960814221 is an apocalyptic number.
It is an amenable number.
1960814221 is a deficient number, since it is larger than the sum of its proper divisors (115342031).
1960814221 is a wasteful number, since it uses less digits than its factorization.
1960814221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115342030.
The product of its (nonzero) digits is 6912, while the sum is 34.
The square root of 1960814221 is about 44281.0819763926. The cubic root of 1960814221 is about 1251.6382191990.
The spelling of 1960814221 in words is "one billion, nine hundred sixty million, eight hundred fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •