Base | Representation |
---|---|
bin | 1001010100010111… |
… | …11110101001011110 |
3 | 110220122120001121201 |
4 | 10222023332221132 |
5 | 40221201004213 |
6 | 2144230150114 |
7 | 234654451411 |
oct | 45213765136 |
9 | 13818501551 |
10 | 5002750558 |
11 | 2137a165a3 |
12 | b774b233a |
13 | 6195b2840 |
14 | 3565b9b78 |
15 | 1e42eb6dd |
hex | 12a2fea5e |
5002750558 has 8 divisors (see below), whose sum is σ = 8081366328. Its totient is φ = 2308961784.
The previous prime is 5002750553. The next prime is 5002750567. The reversal of 5002750558 is 8550572005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×50027505583 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 3 ways as a sum of consecutive naturals, for example, 96206716 + ... + 96206767.
It is an arithmetic number, because the mean of its divisors is an integer number (1010170791).
Almost surely, 25002750558 is an apocalyptic number.
5002750558 is a deficient number, since it is larger than the sum of its proper divisors (3078615770).
5002750558 is a wasteful number, since it uses less digits than its factorization.
5002750558 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192413498.
The product of its (nonzero) digits is 70000, while the sum is 37.
The square root of 5002750558 is about 70730.1248266960. The cubic root of 5002750558 is about 1710.2894483981.
The spelling of 5002750558 in words is "five billion, two million, seven hundred fifty thousand, five hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •