Base | Representation |
---|---|
bin | 1001011010101011… |
… | …00101011111011001 |
3 | 111001100000010020201 |
4 | 10231111211133121 |
5 | 40323213204401 |
6 | 2153355022201 |
7 | 236165616232 |
oct | 45525453731 |
9 | 14040003221 |
10 | 5055600601 |
11 | 2164833617 |
12 | b9113a961 |
13 | 62752825c |
14 | 35d616089 |
15 | 1e8c8ab01 |
hex | 12d5657d9 |
5055600601 has 8 divisors (see below), whose sum is σ = 5212668384. Its totient is φ = 4900328160.
The previous prime is 5055600587. The next prime is 5055600611. The reversal of 5055600601 is 1060065505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5055600601 - 29 = 5055600089 is a prime.
It is a super-2 number, since 2×50556006012 = 51118194873663122402, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5055600601.
It is not an unprimeable number, because it can be changed into a prime (5055600611) 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, 443116 + ... + 454381.
It is an arithmetic number, because the mean of its divisors is an integer number (651583548).
Almost surely, 25055600601 is an apocalyptic number.
It is an amenable number.
5055600601 is a deficient number, since it is larger than the sum of its proper divisors (157067783).
5055600601 is a wasteful number, since it uses less digits than its factorization.
5055600601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 897671.
The product of its (nonzero) digits is 4500, while the sum is 28.
The square root of 5055600601 is about 71102.7467894174. The cubic root of 5055600601 is about 1716.2909755968.
The spelling of 5055600601 in words is "five billion, fifty-five million, six hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •