Search a number
-
+
106053250590 = 2385737792
BaseRepresentation
bin110001011000101000…
…1000010111000011110
3101010202000220100000000
41202301101002320132
53214144113004330
6120415321115130
710443045520260
oct1426121027036
9333660810000
10106053250590
1140a82327941
1218679028aa6
13a001931321
1451c0d71b30
152b5a890560
hex18b1442e1e

106053250590 has 432 divisors, whose sum is σ = 340385546592. Its totient is φ = 23287036032.

The previous prime is 106053250571. The next prime is 106053250621. The reversal of 106053250590 is 95052350601.

106053250590 is a `hidden beast` number, since 1 + 0 + 60 + 5 + 3 + 2 + 5 + 0 + 590 = 666.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 1342446171 + ... + 1342446249.

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

Almost surely, 2106053250590 is an apocalyptic number.

106053250590 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

106053250590 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 40500, while the sum is 36.

The spelling of 106053250590 in words is "one hundred six billion, fifty-three million, two hundred fifty thousand, five hundred ninety".