Base | Representation |
---|---|
bin | 1100101011101… |
… | …10010000110100 |
3 | 21102012012102212 |
4 | 12111312100310 |
5 | 204213444310 |
6 | 14320152552 |
7 | 2431206422 |
oct | 625662064 |
9 | 242165385 |
10 | 106390580 |
11 | 550668aa |
12 | 2b768758 |
13 | 1907050a |
14 | 101b6112 |
15 | 9518205 |
hex | 6576434 |
106390580 has 12 divisors (see below), whose sum is σ = 223420260. Its totient is φ = 42556224.
The previous prime is 106390561. The next prime is 106390621. The reversal of 106390580 is 85093601.
It can be written as a sum of positive squares in 2 ways, for example, as 59413264 + 46977316 = 7708^2 + 6854^2 .
It is a super-2 number, since 2×1063905802 = 22637911025472800, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2659745 + ... + 2659784.
It is an arithmetic number, because the mean of its divisors is an integer number (18618355).
Almost surely, 2106390580 is an apocalyptic number.
106390580 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106390580 is an abundant number, since it is smaller than the sum of its proper divisors (117029680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106390580 is a wasteful number, since it uses less digits than its factorization.
106390580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5319538 (or 5319536 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 32.
The square root of 106390580 is about 10314.5809415604. The cubic root of 106390580 is about 473.8429158958.
The spelling of 106390580 in words is "one hundred six million, three hundred ninety thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •