Search a number
-
+
515013891513 = 31121418771051
BaseRepresentation
bin1110111111010010011…
…10000101010110111001
31211020100012111102111120
413133221032011112321
531414222024012023
61032332155015453
752131344563662
oct7375116052671
91736305442446
10515013891513
11189463a08400
128399113a589
133974781ba54
141acd9222369
15d5e3c8d8e3
hex77e93855b9

515013891513 has 12 divisors (see below), whose sum is σ = 754786199664. Its totient is φ = 312129631000.

The previous prime is 515013891479. The next prime is 515013891551. The reversal of 515013891513 is 315198310515.

It is not a de Polignac number, because 515013891513 - 218 = 515013629369 is a prime.

It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.

It is not an unprimeable number, because it can be changed into a prime (515013891113) 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 11 ways as a sum of consecutive naturals, for example, 709385163 + ... + 709385888.

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

Almost surely, 2515013891513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1418771076 (or 1418771065 counting only the distinct ones).

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

The spelling of 515013891513 in words is "five hundred fifteen billion, thirteen million, eight hundred ninety-one thousand, five hundred thirteen".

Divisors: 1 3 11 33 121 363 1418771051 4256313153 15606481561 46819444683 171671297171 515013891513