Search a number
-
+
5901053211159 = 317115706925709
BaseRepresentation
bin101010111011111001000…
…1011100011001000010111
3202220010122112200212202020
41111313302023203020113
51233140324110224114
620314523441544223
71146223412454141
oct125676213431027
922803575625666
105901053211159
1119756937744a7
127b37b6945073
1333a60bacb432
141658809abc91
15a3777440aa9
hex55df22e3217

5901053211159 has 8 divisors (see below), whose sum is σ = 8330898651120. Its totient is φ = 3702621622656.

The previous prime is 5901053211089. The next prime is 5901053211167. The reversal of 5901053211159 is 9511123501095.

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

It is not a de Polignac number, because 5901053211159 - 219 = 5901052686871 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 5901053211159.

It is a congruent number.

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

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

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

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

Almost surely, 25901053211159 is an apocalyptic number.

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

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

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

The sum of its prime factors is 115706925729.

The product of its (nonzero) digits is 60750, while the sum is 42.

The spelling of 5901053211159 in words is "five trillion, nine hundred one billion, fifty-three million, two hundred eleven thousand, one hundred fifty-nine".

Divisors: 1 3 17 51 115706925709 347120777127 1967017737053 5901053211159