Base | Representation |
---|---|
bin | 1110101101101010010… |
… | …10010100011101111001 |
3 | 1210022220200120010021200 |
4 | 13112311022110131321 |
5 | 31240331420230001 |
6 | 1024125142524413 |
7 | 51345004546422 |
oct | 7266512243571 |
9 | 1708820503250 |
10 | 505550555001 |
11 | 185448121638 |
12 | 81b8ba36709 |
13 | 3889a08264b |
14 | 1a67c47a649 |
15 | d23d08c086 |
hex | 75b5294779 |
505550555001 has 12 divisors (see below), whose sum is σ = 744017798628. Its totient is φ = 330674576544.
The previous prime is 505550554987. The next prime is 505550555033. The reversal of 505550555001 is 100555055505.
It is a happy number.
505550555001 is a `hidden beast` number, since 5 + 0 + 5 + 550 + 55 + 50 + 0 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 409214810601 + 96335744400 = 639699^2 + 310380^2 .
It is a de Polignac number, because none of the positive numbers 2k-505550555001 is a prime.
It is a super-2 number, since 2×5055505550012 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (505550555701) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 529926730 + ... + 529927683.
It is an arithmetic number, because the mean of its divisors is an integer number (62001483219).
Almost surely, 2505550555001 is an apocalyptic number.
It is an amenable number.
505550555001 is a deficient number, since it is larger than the sum of its proper divisors (238467243627).
505550555001 is a wasteful number, since it uses less digits than its factorization.
505550555001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1059854472 (or 1059854469 counting only the distinct ones).
The product of its (nonzero) digits is 78125, while the sum is 36.
The spelling of 505550555001 in words is "five hundred five billion, five hundred fifty million, five hundred fifty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •