Base | Representation |
---|---|
bin | 1111101110011000100 |
3 | 222011211000 |
4 | 1331303010 |
5 | 112442033 |
6 | 15013300 |
7 | 4244145 |
oct | 1756304 |
9 | 864730 |
10 | 515268 |
11 | 322146 |
12 | 20a230 |
13 | 1506c0 |
14 | d5acc |
15 | a2a13 |
hex | 7dcc4 |
515268 has 48 divisors (see below), whose sum is σ = 1442560. Its totient is φ = 158112.
The previous prime is 515237. The next prime is 515279. The reversal of 515268 is 862515.
515268 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×5152682 = 531002223648, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
515268 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1221 + ... + 1587.
2515268 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 515268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (721280).
515268 is an abundant number, since it is smaller than the sum of its proper divisors (927292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
515268 is a wasteful number, since it uses less digits than its factorization.
515268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393 (or 385 counting only the distinct ones).
The product of its digits is 2400, while the sum is 27.
The square root of 515268 is about 717.8217048822. The cubic root of 515268 is about 80.1698474761.
The spelling of 515268 in words is "five hundred fifteen thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •