Search a number
-
+
511051001105 = 5102210200221
BaseRepresentation
bin1110110111111010000…
…00110110110100010001
31210212010000121201211202
413123331000312310101
531333113024013410
61030435032320545
751631214556431
oct7337500666421
91725100551752
10511051001105
1118780aa70167
1283065b43155
13392657c1398
141aa40bac2c1
15d460de8ca5
hex76fd036d11

511051001105 has 4 divisors (see below), whose sum is σ = 613261201332. Its totient is φ = 408840800880.

The previous prime is 511051001101. The next prime is 511051001119. The reversal of 511051001105 is 501100150115.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 382967896336 + 128083104769 = 618844^2 + 357887^2 .

It is not a de Polignac number, because 511051001105 - 22 = 511051001101 is a prime.

It is a super-2 number, since 2×5110510011052 (a number of 24 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 (511051001101) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51105100106 + ... + 51105100115.

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

Almost surely, 2511051001105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 102210200226.

The product of its (nonzero) digits is 125, while the sum is 20.

The spelling of 511051001105 in words is "five hundred eleven billion, fifty-one million, one thousand, one hundred five".

Divisors: 1 5 102210200221 511051001105