Base | Representation |
---|---|
bin | 111100100110010… |
… | …010111111011101 |
3 | 2121212001022002201 |
4 | 330212102333131 |
5 | 4040232002341 |
6 | 244514451501 |
7 | 34123366645 |
oct | 7446227735 |
9 | 2555038081 |
10 | 1016672221 |
11 | 481980984 |
12 | 244593b91 |
13 | 1328269c6 |
14 | 9904b525 |
15 | 5e3c6331 |
hex | 3c992fdd |
1016672221 has 2 divisors, whose sum is σ = 1016672222. Its totient is φ = 1016672220.
The previous prime is 1016672213. The next prime is 1016672257. The reversal of 1016672221 is 1222766101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 588596121 + 428076100 = 24261^2 + 20690^2 .
It is an emirp because it is prime and its reverse (1222766101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1016672221 - 23 = 1016672213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1016672221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1016672201) 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 as a sum of consecutive naturals, namely, 508336110 + 508336111.
It is an arithmetic number, because the mean of its divisors is an integer number (508336111).
Almost surely, 21016672221 is an apocalyptic number.
It is an amenable number.
1016672221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1016672221 is an equidigital number, since it uses as much as digits as its factorization.
1016672221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
The square root of 1016672221 is about 31885.2978816256. The cubic root of 1016672221 is about 1005.5268051517.
The spelling of 1016672221 in words is "one billion, sixteen million, six hundred seventy-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.213 sec. • engine limits •