Search a number
-
+
506064160852 = 22491257670143
BaseRepresentation
bin1110101110100111100…
…01100100100001010100
31210101020111000000001121
413113103301210201110
531242404411121402
61024252131133324
751363512251525
oct7272361444124
91711214000047
10506064160852
11185691031288
12820b3a44244
133894c5bc633
141a6ca77484c
15d26d1e1837
hex75d3c64854

506064160852 has 12 divisors (see below), whose sum is σ = 887415975936. Its totient is φ = 252516739160.

The previous prime is 506064160841. The next prime is 506064160873. The reversal of 506064160852 is 258061460605.

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

It is a junction number, because it is equal to n+sod(n) for n = 506064160799 and 506064160808.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2506064160852 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 345600, while the sum is 43.

The spelling of 506064160852 in words is "five hundred six billion, sixty-four million, one hundred sixty thousand, eight hundred fifty-two".

Divisors: 1 2 4 491 982 1964 257670143 515340286 1030680572 126516040213 253032080426 506064160852