Search a number
-
+
5152010169 = 32297499287
BaseRepresentation
bin1001100110001010…
…10110111110111001
3111022001102020022110
410303011112332321
541022403311134
62211121242533
7241446235545
oct46305267671
914261366273
105152010169
1122041a2549
12bb9493449
136414b2737
1436c350a25
152024817e9
hex133156fb9

5152010169 has 8 divisors (see below), whose sum is σ = 6899344960. Its totient is φ = 3419674416.

The previous prime is 5152010161. The next prime is 5152010197. The reversal of 5152010169 is 9610102515.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 5152010169 - 23 = 5152010161 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (5152010161) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 25152010169 is an apocalyptic number.

It is an amenable number.

5152010169 is a deficient number, since it is larger than the sum of its proper divisors (1747334791).

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

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

The sum of its prime factors is 7499519.

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

The square root of 5152010169 is about 71777.5046166973. The cubic root of 5152010169 is about 1727.1321580341.

The spelling of 5152010169 in words is "five billion, one hundred fifty-two million, ten thousand, one hundred sixty-nine".

Divisors: 1 3 229 687 7499287 22497861 1717336723 5152010169