Search a number
-
+
5122011333 = 31707337111
BaseRepresentation
bin1001100010100101…
…11011000011000101
3111012221222010122110
410301102323003011
540442213330313
62204130251233
7240633243435
oct46122730305
914187863573
105122011333
112199272a1a
12bab426b19
1363820b14a
143683822c5
151eea07ec3
hex1314bb0c5

5122011333 has 4 divisors (see below), whose sum is σ = 6829348448. Its totient is φ = 3414674220.

The previous prime is 5122011259. The next prime is 5122011337. The reversal of 5122011333 is 3331102215.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 5122011333 - 29 = 5122010821 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5122011337) 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, 853668553 + ... + 853668558.

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

Almost surely, 25122011333 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1707337114.

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

The square root of 5122011333 is about 71568.2285165701. The cubic root of 5122011333 is about 1723.7734144362.

Adding to 5122011333 its reverse (3331102215), we get a palindrome (8453113548).

The spelling of 5122011333 in words is "five billion, one hundred twenty-two million, eleven thousand, three hundred thirty-three".

Divisors: 1 3 1707337111 5122011333