Base | Representation |
---|---|
bin | 101000100100010001101… |
… | …0110011110101101111011 |
3 | 201202000020102211211021101 |
4 | 1101020203112132231323 |
5 | 1212322020411131010 |
6 | 15505155315152231 |
7 | 1113546053354260 |
oct | 121104326365573 |
9 | 21660212754241 |
10 | 5575460645755 |
11 | 185a5a3201000 |
12 | 76068a5a5677 |
13 | 3159c0a71700 |
14 | 153bd4913267 |
15 | 9a06d05e73a |
hex | 5122359eb7b |
5575460645755 has 192 divisors, whose sum is σ = 9586705812480. Its totient is φ = 3039319895040.
The previous prime is 5575460645753. The next prime is 5575460645767.
5575460645755 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5575460645755 - 21 = 5575460645753 is a prime.
It is a super-2 number, since 2×55754606457552 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5575460645753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 149565799 + ... + 149603071.
It is an arithmetic number, because the mean of its divisors is an integer number (49930759440).
Almost surely, 25575460645755 is an apocalyptic number.
5575460645755 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5575460645755 is a deficient number, since it is larger than the sum of its proper divisors (4011245166725).
5575460645755 is a wasteful number, since it uses less digits than its factorization.
5575460645755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37363 (or 37328 counting only the distinct ones).
The product of its (nonzero) digits is 441000000, while the sum is 64.
The spelling of 5575460645755 in words is "five trillion, five hundred seventy-five billion, four hundred sixty million, six hundred forty-five thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •