Search a number
-
+
485051095461 = 3315215603177
BaseRepresentation
bin1110000111011110100…
…11000101100110100101
31201101000001012200100110
413003233103011212211
530421341040023321
61010455052203233
750021006166312
oct7035723054645
91641001180313
10485051095461
11177788775239
127a00a769519
133698108192a
1419695addd09
15c93d563176
hex70ef4c59a5

485051095461 has 8 divisors (see below), whose sum is σ = 667597206784. Its totient is φ = 312936190560.

The previous prime is 485051095457. The next prime is 485051095469. The reversal of 485051095461 is 164590150584.

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

It is not a de Polignac number, because 485051095461 - 22 = 485051095457 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 485051095461.

It is a congruent number.

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

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

Almost surely, 2485051095461 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5215603211.

The product of its (nonzero) digits is 864000, while the sum is 48.

The spelling of 485051095461 in words is "four hundred eighty-five billion, fifty-one million, ninety-five thousand, four hundred sixty-one".

Divisors: 1 3 31 93 5215603177 15646809531 161683698487 485051095461