Search a number
-
+
51225314050505 = 571463580401443
BaseRepresentation
bin10111010010110110100101…
…01001011100000111001001
320201101002111012201101020102
423221123102221130013021
523203233420344104010
6300540330121535145
713534623015124520
oct1351332251340711
9221332435641212
1051225314050505
111535a596381a81
1258b39860444b5
1322776ac62139a
14c91465aa94b7
155dc74bda4ba5
hex2e96d2a5c1c9

51225314050505 has 8 divisors (see below), whose sum is σ = 70251859269312. Its totient is φ = 35125929634608.

The previous prime is 51225314050487. The next prime is 51225314050553. The reversal of 51225314050505 is 50505041352215.

51225314050505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a cyclic number.

It is not a de Polignac number, because 51225314050505 - 216 = 51225313984969 is a prime.

It is an unprimeable number.

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, 731790200687 + ... + 731790200756.

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

Almost surely, 251225314050505 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1463580401455.

The product of its (nonzero) digits is 150000, while the sum is 38.

The spelling of 51225314050505 in words is "fifty-one trillion, two hundred twenty-five billion, three hundred fourteen million, fifty thousand, five hundred five".

Divisors: 1 5 7 35 1463580401443 7317902007215 10245062810101 51225314050505