Search a number
-
+
490537369056 = 253743163104147
BaseRepresentation
bin1110010001101100100…
…11100011110111100000
31201220011101121020212210
413020312103203313200
531014110031302211
61013203314122120
750303654561130
oct7106623436740
91656141536783
10490537369056
1117a043613849
127b09bb80340
133734689a877
1419a565c2ac0
15cb600209a6
hex72364e3de0

490537369056 has 192 divisors, whose sum is σ = 1515088447488. Its totient is φ = 136053001728.

The previous prime is 490537369043. The next prime is 490537369061. The reversal of 490537369056 is 650963735094.

It is a happy number.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4657975 + ... + 4762121.

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

Almost surely, 2490537369056 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 490537369056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (757544223744).

490537369056 is an abundant number, since it is smaller than the sum of its proper divisors (1024551078432).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

490537369056 is an evil number, because the sum of its binary digits is even.

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

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

The spelling of 490537369056 in words is "four hundred ninety billion, five hundred thirty-seven million, three hundred sixty-nine thousand, fifty-six".