Base | Representation |
---|---|
bin | 1001010100010111… |
… | …11110101001011101 |
3 | 110220122120001121200 |
4 | 10222023332221131 |
5 | 40221201004212 |
6 | 2144230150113 |
7 | 234654451410 |
oct | 45213765135 |
9 | 13818501550 |
10 | 5002750557 |
11 | 2137a165a2 |
12 | b774b2339 |
13 | 6195b283c |
14 | 3565b9b77 |
15 | 1e42eb6dc |
hex | 12a2fea5d |
5002750557 has 24 divisors (see below), whose sum is σ = 8295565824. Its totient is φ = 2845887264.
The previous prime is 5002750553. The next prime is 5002750567. The reversal of 5002750557 is 7550572005.
5002750557 is a `hidden beast` number, since 50 + 0 + 2 + 7 + 50 + 557 = 666.
5002750557 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5002750557 - 22 = 5002750553 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5002750553) 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 23 ways as a sum of consecutive naturals, for example, 163998 + ... + 192095.
It is an arithmetic number, because the mean of its divisors is an integer number (345648576).
Almost surely, 25002750557 is an apocalyptic number.
It is an amenable number.
5002750557 is a deficient number, since it is larger than the sum of its proper divisors (3292815267).
5002750557 is a wasteful number, since it uses less digits than its factorization.
5002750557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356329 (or 356326 counting only the distinct ones).
The product of its (nonzero) digits is 61250, while the sum is 36.
The square root of 5002750557 is about 70730.1248196269. The cubic root of 5002750557 is about 1710.2894482841.
The spelling of 5002750557 in words is "five billion, two million, seven hundred fifty thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •