Base | Representation |
---|---|
bin | 1110101101100100111… |
… | …00110000001101000000 |
3 | 1210022210111221111202220 |
4 | 13112302130300031000 |
5 | 31240233243234202 |
6 | 1024120435411040 |
7 | 51343613035110 |
oct | 7266234601500 |
9 | 1708714844686 |
10 | 505505055552 |
11 | 185424475192 |
12 | 81b78753a80 |
13 | 388908118b3 |
14 | 1a6763d5040 |
15 | d2390a0abc |
hex | 75b2730340 |
505505055552 has 112 divisors (see below), whose sum is σ = 1528836029952. Its totient is φ = 144403084800.
The previous prime is 505505055533. The next prime is 505505055553. The reversal of 505505055552 is 255550505505.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-2 number, since 2×5055050555522 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505505055553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7831603 + ... + 7895885.
It is an arithmetic number, because the mean of its divisors is an integer number (13650321696).
Almost surely, 2505505055552 is an apocalyptic number.
It is an amenable number.
505505055552 is an abundant number, since it is smaller than the sum of its proper divisors (1023330974400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505505055552 is a wasteful number, since it uses less digits than its factorization.
505505055552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70156 (or 70146 counting only the distinct ones).
The product of its (nonzero) digits is 781250, while the sum is 42.
The spelling of 505505055552 in words is "five hundred five billion, five hundred five million, fifty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •