Search a number
-
+
5015433133401 = 310322877097147
BaseRepresentation
bin100100011111011111100…
…0111000011110101011001
3122202110201011021112102120
41020332333013003311121
51124133101340232101
614400020322051453
71025232052142145
oct110767707036531
918673634245376
105015433133401
111664040285069
126900364a9b89
132a4c51582b72
14134a69318225
158a6e2591b36
hex48fbf1c3d59

5015433133401 has 16 divisors (see below), whose sum is σ = 6755122243584. Its totient is φ = 3309711454224.

The previous prime is 5015433133387. The next prime is 5015433133439. The reversal of 5015433133401 is 1043313345105.

It is not a de Polignac number, because 5015433133401 - 27 = 5015433133273 is a prime.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2841891 + ... + 4255256.

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

Almost surely, 25015433133401 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 7099540.

The product of its (nonzero) digits is 32400, while the sum is 33.

Adding to 5015433133401 its reverse (1043313345105), we get a palindrome (6058746478506).

It can be divided in two parts, 50 and 15433133401, that added together give a palindrome (15433133451).

The spelling of 5015433133401 in words is "five trillion, fifteen billion, four hundred thirty-three million, one hundred thirty-three thousand, four hundred one".

Divisors: 1 3 103 309 2287 6861 235561 706683 7097147 21291441 731006141 2193018423 16231175189 48693525567 1671811044467 5015433133401