Base | Representation |
---|---|
bin | 1001010111000101… |
… | …11101100101110101 |
3 | 110222020110112100121 |
4 | 10223202331211311 |
5 | 40243020142012 |
6 | 2150403011541 |
7 | 235352331211 |
oct | 45342754565 |
9 | 13866415317 |
10 | 5025552757 |
11 | 2149880195 |
12 | b83069bb1 |
13 | 621237574 |
14 | 359633941 |
15 | 1e6302a07 |
hex | 12b8bd975 |
5025552757 has 4 divisors (see below), whose sum is σ = 5026068736. Its totient is φ = 5025036780.
The previous prime is 5025552751. The next prime is 5025552793. The reversal of 5025552757 is 7572555205.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5025552757 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 (5025552751) 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 3 ways as a sum of consecutive naturals, for example, 243093 + ... + 262954.
It is an arithmetic number, because the mean of its divisors is an integer number (1256517184).
Almost surely, 25025552757 is an apocalyptic number.
It is an amenable number.
5025552757 is a deficient number, since it is larger than the sum of its proper divisors (515979).
5025552757 is an equidigital number, since it uses as much as digits as its factorization.
5025552757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 515978.
The product of its (nonzero) digits is 612500, while the sum is 43.
The square root of 5025552757 is about 70891.1331338412. The cubic root of 5025552757 is about 1712.8839717406.
The spelling of 5025552757 in words is "five billion, twenty-five million, five hundred fifty-two thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •