Base | Representation |
---|---|
bin | 11110000111110… |
… | …001110001001100 |
3 | 1022012220201012110 |
4 | 132013301301030 |
5 | 2013332332330 |
6 | 122051304020 |
7 | 15344310120 |
oct | 3607616114 |
9 | 1265821173 |
10 | 505355340 |
11 | 23a294a46 |
12 | 1212ab010 |
13 | 8090b839 |
14 | 4b18b580 |
15 | 2e574db0 |
hex | 1e1f1c4c |
505355340 has 96 divisors (see below), whose sum is σ = 1656635904. Its totient is φ = 112688640.
The previous prime is 505355309. The next prime is 505355341. The reversal of 505355340 is 43553505.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 505355298 and 505355307.
It is not an unprimeable number, because it can be changed into a prime (505355341) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2547 + ... + 31893.
It is an arithmetic number, because the mean of its divisors is an integer number (17256624).
Almost surely, 2505355340 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 505355340, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (828317952).
505355340 is an abundant number, since it is smaller than the sum of its proper divisors (1151280564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505355340 is a wasteful number, since it uses less digits than its factorization.
505355340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29407 (or 29405 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 30.
The square root of 505355340 is about 22480.1098751763. The cubic root of 505355340 is about 796.5241596219.
The spelling of 505355340 in words is "five hundred five million, three hundred fifty-five thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •