Search a number
-
+
389462590551 = 3157826884481
BaseRepresentation
bin1011010101011011100…
…01111000010001010111
31101020021022120111200210
411222231301320101113
522340104410344201
6454525554540503
740065150253446
oct5525561702127
91336238514623
10389462590551
1114019652a751
1263592297733
132a9594cb418
1414bc890ad5d
15a1e67831d6
hex5aadc78457

389462590551 has 8 divisors (see below), whose sum is σ = 522590992624. Its totient is φ = 257987957760.

The previous prime is 389462590549. The next prime is 389462590619. The reversal of 389462590551 is 155095264983.

It is a happy number.

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

It is not a de Polignac number, because 389462590551 - 21 = 389462590549 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 2389462590551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 826884641.

The product of its (nonzero) digits is 11664000, while the sum is 57.

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

Divisors: 1 3 157 471 826884481 2480653443 129820863517 389462590551