Base | Representation |
---|---|
bin | 1100101001000… |
… | …11010001100100 |
3 | 21101112221011020 |
4 | 12110203101210 |
5 | 204122110120 |
6 | 14305011140 |
7 | 2425262412 |
oct | 624432144 |
9 | 241487136 |
10 | 106050660 |
11 | 54954481 |
12 | 2b623ab0 |
13 | 18c81891 |
14 | 101282b2 |
15 | 949c640 |
hex | 6523464 |
106050660 has 48 divisors (see below), whose sum is σ = 297943296. Its totient is φ = 28184832.
The previous prime is 106050653. The next prime is 106050661. The reversal of 106050660 is 66050601.
It is a super-2 number, since 2×1060506602 = 22493484972871200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106050660.
It is not an unprimeable number, because it can be changed into a prime (106050661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15957 + ... + 21603.
It is an arithmetic number, because the mean of its divisors is an integer number (6207152).
Almost surely, 2106050660 is an apocalyptic number.
106050660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106050660 is an abundant number, since it is smaller than the sum of its proper divisors (191892636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106050660 is a wasteful number, since it uses less digits than its factorization.
106050660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5972 (or 5970 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 106050660 is about 10298.0901141911. The cubic root of 106050660 is about 473.3377316702.
The spelling of 106050660 in words is "one hundred six million, fifty thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •