Search a number
-
+
5110325150433 = 34418938548999
BaseRepresentation
bin100101001011101011100…
…0111011000001011100001
3200002112122100100110022220
41022113113013120023201
51132211421214303213
614511352335221253
71035131423032056
oct112272707301341
920075570313286
105110325150433
1116a0305359a38
126a64b9677829
132b0b94a56779
141394abc0902d
158cde8144e23
hex4a5d71d82e1

5110325150433 has 8 divisors (see below), whose sum is σ = 6813921240000. Its totient is φ = 3406806247248.

The previous prime is 5110325150429. The next prime is 5110325150443. The reversal of 5110325150433 is 3340515230115.

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

It is not a de Polignac number, because 5110325150433 - 22 = 5110325150429 is a prime.

It is a super-2 number, since 2×51103251504332 (a number of 26 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 5110325150394 and 5110325150403.

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

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

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

Almost surely, 25110325150433 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 38593191.

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

The spelling of 5110325150433 in words is "five trillion, one hundred ten billion, three hundred twenty-five million, one hundred fifty thousand, four hundred thirty-three".

Divisors: 1 3 44189 132567 38548999 115646997 1703441716811 5110325150433