Base | Representation |
---|---|
bin | 1100101000111… |
… | …11110101101110 |
3 | 21101112012212010 |
4 | 12110133311232 |
5 | 204121132330 |
6 | 14304422050 |
7 | 2425203402 |
oct | 624376556 |
9 | 241465763 |
10 | 106036590 |
11 | 54944950 |
12 | 2b617926 |
13 | 18c7835a |
14 | 10123102 |
15 | 94983b0 |
hex | 651fd6e |
106036590 has 32 divisors (see below), whose sum is σ = 277623936. Its totient is φ = 25705760.
The previous prime is 106036529. The next prime is 106036597. The reversal of 106036590 is 95630601.
It is a happy number.
It is a super-2 number, since 2×1060365902 = 22487516837656200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106036597) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 160332 + ... + 160991.
It is an arithmetic number, because the mean of its divisors is an integer number (8675748).
Almost surely, 2106036590 is an apocalyptic number.
106036590 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106036590 is an abundant number, since it is smaller than the sum of its proper divisors (171587346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106036590 is a wasteful number, since it uses less digits than its factorization.
106036590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321344.
The product of its (nonzero) digits is 4860, while the sum is 30.
The square root of 106036590 is about 10297.4069551514. The cubic root of 106036590 is about 473.3167977869.
The spelling of 106036590 in words is "one hundred six million, thirty-six thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •