Base | Representation |
---|---|
bin | 1001110000010000… |
… | …01000101100011101 |
3 | 111111221122001212212 |
4 | 10320020020230131 |
5 | 41211033433112 |
6 | 2223343010205 |
7 | 243524366552 |
oct | 47010105435 |
9 | 14457561785 |
10 | 5236624157 |
11 | 2247a35266 |
12 | 1021899965 |
13 | 655b99c9b |
14 | 379698a29 |
15 | 209ae7522 |
hex | 138208b1d |
5236624157 has 4 divisors (see below), whose sum is σ = 5237103036. Its totient is φ = 5236145280.
The previous prime is 5236624093. The next prime is 5236624193. The reversal of 5236624157 is 7514266325.
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 2045391076 + 3191233081 = 45226^2 + 56491^2 .
It is a cyclic number.
It is not a de Polignac number, because 5236624157 - 26 = 5236624093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5236624457) 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 in 3 ways as a sum of consecutive naturals, for example, 222644 + ... + 245037.
It is an arithmetic number, because the mean of its divisors is an integer number (1309275759).
Almost surely, 25236624157 is an apocalyptic number.
It is an amenable number.
5236624157 is a deficient number, since it is larger than the sum of its proper divisors (478879).
5236624157 is a wasteful number, since it uses less digits than its factorization.
5236624157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478878.
The product of its digits is 302400, while the sum is 41.
The square root of 5236624157 is about 72364.5227787761. The cubic root of 5236624157 is about 1736.5360421636.
The spelling of 5236624157 in words is "five billion, two hundred thirty-six million, six hundred twenty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •