Base | Representation |
---|---|
bin | 1010101110000111… |
… | …01100111011110111 |
3 | 112212010002111222000 |
4 | 11113003230323313 |
5 | 43241410234300 |
6 | 2351041310343 |
7 | 262425262260 |
oct | 52703547367 |
9 | 15763074860 |
10 | 5755555575 |
11 | 2493952100 |
12 | 11476353b3 |
13 | 70954ccb3 |
14 | 3c857b967 |
15 | 23a44ec00 |
hex | 1570ecef7 |
5755555575 has 144 divisors (see below), whose sum is σ = 13283316480. Its totient is φ = 2391681600.
The previous prime is 5755555529. The next prime is 5755555577.
5755555575 is nontrivially palindromic in base 10.
5755555575 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 5755555575 - 217 = 5755424503 is a prime.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5755555577) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 566692 + ... + 576758.
Almost surely, 25755555575 is an apocalyptic number.
5755555575 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5755555575 is an abundant number, since it is smaller than the sum of its proper divisors (7527760905).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5755555575 is a wasteful number, since it uses less digits than its factorization.
5755555575 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10115 (or 10093 counting only the distinct ones).
The product of its digits is 19140625, while the sum is 54.
The square root of 5755555575 is about 75865.3779730913. The cubic root of 5755555575 is about 1792.1007321363.
The spelling of 5755555575 in words is "five billion, seven hundred fifty-five million, five hundred fifty-five thousand, five hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •