Base | Representation |
---|---|
bin | 1010010101100111… |
… | …00101101100111011 |
3 | 112022210022110122122 |
4 | 11022303211230323 |
5 | 42331300130201 |
6 | 2314415511455 |
7 | 254351156513 |
oct | 51263455473 |
9 | 15283273578 |
10 | 5550005051 |
11 | 2398918a38 |
12 | 10aa82858b |
13 | 6a5aa1476 |
14 | 3a9152843 |
15 | 22739ae1b |
hex | 14ace5b3b |
5550005051 has 8 divisors (see below), whose sum is σ = 6030566400. Its totient is φ = 5088289320.
The previous prime is 5550005047. The next prime is 5550005101. The reversal of 5550005051 is 1505000555.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5550005051 - 22 = 5550005047 is a prime.
It is a super-2 number, since 2×55500050512 = 61605112132251025202, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5550005051.
It is not an unprimeable number, because it can be changed into a prime (5550305051) 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 7 ways as a sum of consecutive naturals, for example, 4710791 + ... + 4711968.
It is an arithmetic number, because the mean of its divisors is an integer number (753820800).
Almost surely, 25550005051 is an apocalyptic number.
5550005051 is a deficient number, since it is larger than the sum of its proper divisors (480561349).
5550005051 is a wasteful number, since it uses less digits than its factorization.
5550005051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9422809.
The product of its (nonzero) digits is 3125, while the sum is 26.
The square root of 5550005051 is about 74498.3560288413. The cubic root of 5550005051 is about 1770.5075896414.
The spelling of 5550005051 in words is "five billion, five hundred fifty million, five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •