Search a number
-
+
5003250051 = 31667750017
BaseRepresentation
bin1001010100011011…
…11000100110000011
3110220200111102210110
410222031320212003
540221313000201
62144245002403
7234661631562
oct45215704603
913820442713
105003250051
1121382278a8
12b776b3403
13619728cb7
143566a9bd9
151e43996d6
hex12a378983

5003250051 has 4 divisors (see below), whose sum is σ = 6671000072. Its totient is φ = 3335500032.

The previous prime is 5003250019. The next prime is 5003250067. The reversal of 5003250051 is 1500523005.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 5003250051 - 25 = 5003250019 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 833875006 + ... + 833875011.

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

Almost surely, 25003250051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1667750020.

The product of its (nonzero) digits is 750, while the sum is 21.

The square root of 5003250051 is about 70733.6557163561. The cubic root of 5003250051 is about 1710.3463670316.

Adding to 5003250051 its reverse (1500523005), we get a palindrome (6503773056).

The spelling of 5003250051 in words is "five billion, three million, two hundred fifty thousand, fifty-one".

Divisors: 1 3 1667750017 5003250051