Search a number
-
+
5102952 = 2331491427
BaseRepresentation
bin10011011101110101101000
3100121020221020
4103131311220
52301243302
6301212440
761242261
oct23356550
910536836
105102952
112975a18
121861120
1310988ca
1496b968
156abebc
hex4ddd68

5102952 has 32 divisors (see below), whose sum is σ = 12852000. Its totient is φ = 1688384.

The previous prime is 5102863. The next prime is 5102953. The reversal of 5102952 is 2592015.

It is a super-2 number, since 2×51029522 = 52080238228608, which contains 22 as substring.

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

It is not an unprimeable number, because it can be changed into a prime (5102953) 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 7 ways as a sum of consecutive naturals, for example, 2863 + ... + 4289.

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

Almost surely, 25102952 is an apocalyptic number.

It is an amenable number.

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

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

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

5102952 is an odious number, because the sum of its binary digits is odd.

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

The product of its (nonzero) digits is 900, while the sum is 24.

The square root of 5102952 is about 2258.9714473627. The cubic root of 5102952 is about 172.1632666436.

Adding to 5102952 its reverse (2592015), we get a palindrome (7694967).

The spelling of 5102952 in words is "five million, one hundred two thousand, nine hundred fifty-two".

Divisors: 1 2 3 4 6 8 12 24 149 298 447 596 894 1192 1427 1788 2854 3576 4281 5708 8562 11416 17124 34248 212623 425246 637869 850492 1275738 1700984 2551476 5102952