Search a number
-
+
506952 = 23332347
BaseRepresentation
bin1111011110001001000
3221202102000
41323301020
5112210302
614511000
74210665
oct1736110
9852360
10506952
11316976
12205460
13149994
14d2a6c
15a031c
hex7bc48

506952 has 32 divisors (see below), whose sum is σ = 1408800. Its totient is φ = 168912.

The previous prime is 506941. The next prime is 506963. The reversal of 506952 is 259605.

It is an interprime number because it is at equal distance from previous prime (506941) and next prime (506963).

It is a Harshad number since it is a multiple of its sum of digits (27).

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 506952.

It is an unprimeable number.

506952 is an untouchable number, because it is not equal to the sum of proper divisors of any number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 958 + ... + 1389.

It is an arithmetic number, because the mean of its divisors is an integer number (44025).

2506952 is an apocalyptic number.

It is an amenable number.

506952 is an abundant number, since it is smaller than the sum of its proper divisors (901848).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

506952 is a wasteful number, since it uses less digits than its factorization.

506952 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2362 (or 2352 counting only the distinct ones).

The product of its (nonzero) digits is 2700, while the sum is 27.

The square root of 506952 is about 712.0056179554. The cubic root of 506952 is about 79.7362145045.

The spelling of 506952 in words is "five hundred six thousand, nine hundred fifty-two".

Divisors: 1 2 3 4 6 8 9 12 18 24 27 36 54 72 108 216 2347 4694 7041 9388 14082 18776 21123 28164 42246 56328 63369 84492 126738 168984 253476 506952