Base | Representation |
---|---|
bin | 11110001000010… |
… | …001010110001101 |
3 | 1022020011021122000 |
4 | 132020101112031 |
5 | 2013401002220 |
6 | 122054142513 |
7 | 15345356166 |
oct | 3610212615 |
9 | 1266137560 |
10 | 505484685 |
11 | 23a373142 |
12 | 121351a39 |
13 | 80955684 |
14 | 4b1c276d |
15 | 2e59d390 |
hex | 1e21158d |
505484685 has 64 divisors (see below), whose sum is σ = 942796800. Its totient is φ = 256474944.
The previous prime is 505484677. The next prime is 505484687. The reversal of 505484685 is 586484505.
505484685 is a `hidden beast` number, since 505 + 4 + 84 + 68 + 5 = 666.
It is not a de Polignac number, because 505484685 - 23 = 505484677 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 505484685.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505484687) 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 63 ways as a sum of consecutive naturals, for example, 816306 + ... + 816924.
It is an arithmetic number, because the mean of its divisors is an integer number (14731200).
Almost surely, 2505484685 is an apocalyptic number.
It is an amenable number.
505484685 is a deficient number, since it is larger than the sum of its proper divisors (437312115).
505484685 is a wasteful number, since it uses less digits than its factorization.
505484685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919 (or 913 counting only the distinct ones).
The product of its (nonzero) digits is 768000, while the sum is 45.
The square root of 505484685 is about 22482.9865676249. The cubic root of 505484685 is about 796.5921102438.
The spelling of 505484685 in words is "five hundred five million, four hundred eighty-four thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •