Base | Representation |
---|---|
bin | 1001000101000001… |
… | …01101110000001101 |
3 | 110120200020021001112 |
4 | 10202200231300031 |
5 | 34440213444103 |
6 | 2123350021405 |
7 | 231532023101 |
oct | 44240556015 |
9 | 13520207045 |
10 | 4873968653 |
11 | 2081256874 |
12 | b40347865 |
13 | 5c8a02628 |
14 | 343455901 |
15 | 1d7d5dcd8 |
hex | 12282dc0d |
4873968653 has 2 divisors, whose sum is σ = 4873968654. Its totient is φ = 4873968652.
The previous prime is 4873968641. The next prime is 4873968679. The reversal of 4873968653 is 3568693784.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3381073609 + 1492895044 = 58147^2 + 38638^2 .
It is a cyclic number.
It is not a de Polignac number, because 4873968653 - 210 = 4873967629 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4873968592 and 4873968601.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4873968553) 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 as a sum of consecutive naturals, namely, 2436984326 + 2436984327.
It is an arithmetic number, because the mean of its divisors is an integer number (2436984327).
Almost surely, 24873968653 is an apocalyptic number.
It is an amenable number.
4873968653 is a deficient number, since it is larger than the sum of its proper divisors (1).
4873968653 is an equidigital number, since it uses as much as digits as its factorization.
4873968653 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 26127360, while the sum is 59.
The square root of 4873968653 is about 69813.8141989105. The cubic root of 4873968653 is about 1695.4861398859.
The spelling of 4873968653 in words is "four billion, eight hundred seventy-three million, nine hundred sixty-eight thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •