Base | Representation |
---|---|
bin | 11110001000010… |
… | …101000111000110 |
3 | 1022020012001210000 |
4 | 132020111013012 |
5 | 2013402000402 |
6 | 122054342130 |
7 | 15345452142 |
oct | 3610250706 |
9 | 1266161700 |
10 | 505500102 |
11 | 23a383788 |
12 | 12135a946 |
13 | 8095c6b3 |
14 | 4b1c8222 |
15 | 2e5a2c1c |
hex | 1e2151c6 |
505500102 has 40 divisors (see below), whose sum is σ = 1171764000. Its totient is φ = 162688176.
The previous prime is 505500101. The next prime is 505500103. The reversal of 505500102 is 201005505.
It is an interprime number because it is at equal distance from previous prime (505500101) and next prime (505500103).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505500101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 49102 + ... + 58497.
It is an arithmetic number, because the mean of its divisors is an integer number (29294100).
Almost surely, 2505500102 is an apocalyptic number.
505500102 is an abundant number, since it is smaller than the sum of its proper divisors (666263898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505500102 is a wasteful number, since it uses less digits than its factorization.
505500102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107642 (or 107633 counting only the distinct ones).
The product of its (nonzero) digits is 250, while the sum is 18.
The square root of 505500102 is about 22483.3294242645. The cubic root of 505500102 is about 796.6002086993.
Adding to 505500102 its reverse (201005505), we get a palindrome (706505607).
The spelling of 505500102 in words is "five hundred five million, five hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •