Search a number
-
+
50928307517393 = 1231107599384497
BaseRepresentation
bin10111001010001101010111…
…01011011011011111010001
320200022200212022112020002022
423211012223223123133101
523133402133211024033
6300152050321101225
713504306636214645
oct1345065353333721
9220280768466068
1050928307517393
1115255634993759
1258662b7187815
132255698a2a477
14c80d2c34cc25
155d4b673e9098
hex2e51abadb7d1

50928307517393 has 8 divisors (see below), whose sum is σ = 50970285273600. Its totient is φ = 50886330747840.

The previous prime is 50928307517377. The next prime is 50928307517443. The reversal of 50928307517393 is 39371570382905.

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 50928307517393 - 24 = 50928307517377 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

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

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

Almost surely, 250928307517393 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 493327.

The product of its (nonzero) digits is 42865200, while the sum is 62.

The spelling of 50928307517393 in words is "fifty trillion, nine hundred twenty-eight billion, three hundred seven million, five hundred seventeen thousand, three hundred ninety-three".

Divisors: 1 1231 107599 384497 132454369 473315807 41371492703 50928307517393