Base | Representation |
---|---|
bin | 1001011000011110… |
… | …10001011001000001 |
3 | 111000001022122201221 |
4 | 10230033101121001 |
5 | 40304003340233 |
6 | 2151455555041 |
7 | 235553136361 |
oct | 45417213101 |
9 | 14001278657 |
10 | 5037168193 |
11 | 2155394022 |
12 | b86b2ba81 |
13 | 6237734c5 |
14 | 35adb89a1 |
15 | 1e734942d |
hex | 12c3d1641 |
5037168193 has 4 divisors (see below), whose sum is σ = 5089097860. Its totient is φ = 4985238528.
The previous prime is 5037168163. The next prime is 5037168203. The reversal of 5037168193 is 3918617305.
5037168193 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 789778609 + 4247389584 = 28103^2 + 65172^2 .
It is a cyclic number.
It is not a de Polignac number, because 5037168193 - 229 = 4500297281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5037168133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25964688 + ... + 25964881.
It is an arithmetic number, because the mean of its divisors is an integer number (1272274465).
Almost surely, 25037168193 is an apocalyptic number.
It is an amenable number.
5037168193 is a deficient number, since it is larger than the sum of its proper divisors (51929667).
5037168193 is an equidigital number, since it uses as much as digits as its factorization.
5037168193 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51929666.
The product of its (nonzero) digits is 136080, while the sum is 43.
The square root of 5037168193 is about 70973.0103137805. The cubic root of 5037168193 is about 1714.2026051637.
The spelling of 5037168193 in words is "five billion, thirty-seven million, one hundred sixty-eight thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •