Base | Representation |
---|---|
bin | 110001001001001… |
… | …0100000110001001 |
3 | 11020220211020221121 |
4 | 1202102110012021 |
5 | 11334113434243 |
6 | 431343035241 |
7 | 55601666044 |
oct | 14222240611 |
9 | 4226736847 |
10 | 1648968073 |
11 | 776888135 |
12 | 3a029bb21 |
13 | 20381c56c |
14 | 118dddc5b |
15 | 99b731ed |
hex | 62494189 |
1648968073 has 2 divisors, whose sum is σ = 1648968074. Its totient is φ = 1648968072.
The previous prime is 1648968071. The next prime is 1648968109. The reversal of 1648968073 is 3708698461.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1242421504 + 406546569 = 35248^2 + 20163^2 .
It is a cyclic number.
It is not a de Polignac number, because 1648968073 - 21 = 1648968071 is a prime.
Together with 1648968071, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1648968073.
It is not a weakly prime, because it can be changed into another prime (1648968071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 824484036 + 824484037.
It is an arithmetic number, because the mean of its divisors is an integer number (824484037).
Almost surely, 21648968073 is an apocalyptic number.
It is an amenable number.
1648968073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1648968073 is an equidigital number, since it uses as much as digits as its factorization.
1648968073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1741824, while the sum is 52.
The square root of 1648968073 is about 40607.4878932445. The cubic root of 1648968073 is about 1181.4193571164.
The spelling of 1648968073 in words is "one billion, six hundred forty-eight million, nine hundred sixty-eight thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •