Base | Representation |
---|---|
bin | 1001110011101010… |
… | …10000110100110101 |
3 | 111120221110110022101 |
4 | 10321311100310311 |
5 | 41240344344112 |
6 | 2230244102101 |
7 | 244322504104 |
oct | 47165206465 |
9 | 14527413271 |
10 | 5265231157 |
11 | 22620a410a |
12 | 102b394931 |
13 | 65baa4bc4 |
14 | 37d3c403b |
15 | 20c398757 |
hex | 139d50d35 |
5265231157 has 8 divisors (see below), whose sum is σ = 5328627480. Its totient is φ = 5202109440.
The previous prime is 5265231137. The next prime is 5265231161. The reversal of 5265231157 is 7511325625.
It can be written as a sum of positive squares in 4 ways, for example, as 1459698436 + 3805532721 = 38206^2 + 61689^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5265231157 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 (5265231137) 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 in 7 ways as a sum of consecutive naturals, for example, 29944 + ... + 106897.
It is an arithmetic number, because the mean of its divisors is an integer number (666078435).
Almost surely, 25265231157 is an apocalyptic number.
It is an amenable number.
5265231157 is a deficient number, since it is larger than the sum of its proper divisors (63396323).
5265231157 is a wasteful number, since it uses less digits than its factorization.
5265231157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137303.
The product of its digits is 63000, while the sum is 37.
The square root of 5265231157 is about 72561.9125781563. The cubic root of 5265231157 is about 1739.6924586375.
The spelling of 5265231157 in words is "five billion, two hundred sixty-five million, two hundred thirty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •