Base | Representation |
---|---|
bin | 1001100000101111… |
… | …11001001111011101 |
3 | 111011212211222110012 |
4 | 10300113321033131 |
5 | 40424233144222 |
6 | 2202414453005 |
7 | 240354565151 |
oct | 46027711735 |
9 | 14155758405 |
10 | 5106537437 |
11 | 2190564181 |
12 | ba6204165 |
13 | 634c50bb1 |
14 | 3662b5061 |
15 | 1ed49d1e2 |
hex | 1305f93dd |
5106537437 has 8 divisors (see below), whose sum is σ = 5123047104. Its totient is φ = 5090050368.
The previous prime is 5106537431. The next prime is 5106537463. The reversal of 5106537437 is 7347356015.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5106537437 - 222 = 5102343133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5106537394 and 5106537403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5106537431) 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 in 7 ways as a sum of consecutive naturals, for example, 524738 + ... + 534380.
It is an arithmetic number, because the mean of its divisors is an integer number (640380888).
Almost surely, 25106537437 is an apocalyptic number.
It is an amenable number.
5106537437 is a deficient number, since it is larger than the sum of its proper divisors (16509667).
5106537437 is a wasteful number, since it uses less digits than its factorization.
5106537437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11299.
The product of its (nonzero) digits is 264600, while the sum is 41.
The square root of 5106537437 is about 71460.0408410183. The cubic root of 5106537437 is about 1722.0357899820.
The spelling of 5106537437 in words is "five billion, one hundred six million, five hundred thirty-seven thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •