Base | Representation |
---|---|
bin | 1001010100000011… |
… | …01011011111110001 |
3 | 110220110110220001222 |
4 | 10222001223133301 |
5 | 40220003110143 |
6 | 2144052234425 |
7 | 234622505132 |
oct | 45201533761 |
9 | 13813426058 |
10 | 5000050673 |
11 | 2136442092 |
12 | b7660ba15 |
13 | 618b78987 |
14 | 3560b5c89 |
15 | 1e3e66768 |
hex | 12a06b7f1 |
5000050673 has 2 divisors, whose sum is σ = 5000050674. Its totient is φ = 5000050672.
The previous prime is 5000050669. The next prime is 5000050709. The reversal of 5000050673 is 3760500005.
5000050673 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2588062129 + 2411988544 = 50873^2 + 49112^2 .
It is a cyclic number.
It is not a de Polignac number, because 5000050673 - 22 = 5000050669 is a prime.
It is not a weakly prime, because it can be changed into another prime (5000050603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2500025336 + 2500025337.
It is an arithmetic number, because the mean of its divisors is an integer number (2500025337).
Almost surely, 25000050673 is an apocalyptic number.
It is an amenable number.
5000050673 is a deficient number, since it is larger than the sum of its proper divisors (1).
5000050673 is an equidigital number, since it uses as much as digits as its factorization.
5000050673 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 26.
The square root of 5000050673 is about 70711.0364299661. The cubic root of 5000050673 is about 1709.9817232979.
Adding to 5000050673 its reverse (3760500005), we get a palindrome (8760550678).
The spelling of 5000050673 in words is "five billion, fifty thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •