Base | Representation |
---|---|
bin | 1100101111001… |
… | …10010100000000 |
3 | 21110001112000020 |
4 | 12113212110000 |
5 | 204323141121 |
6 | 14334053440 |
7 | 2435130453 |
oct | 627462400 |
9 | 243045006 |
10 | 106849536 |
11 | 5534a702 |
12 | 2b94a280 |
13 | 191a13a1 |
14 | 1029549a |
15 | 95a91c6 |
hex | 65e6500 |
106849536 has 108 divisors (see below), whose sum is σ = 298407648. Its totient is φ = 33938432.
The previous prime is 106849511. The next prime is 106849541. The reversal of 106849536 is 635948601.
It is a super-2 number, since 2×1068495362 = 22833646686830592, 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 (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 406141 + ... + 406403.
Almost surely, 2106849536 is an apocalyptic number.
106849536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106849536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149203824).
106849536 is an abundant number, since it is smaller than the sum of its proper divisors (191558112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106849536 is an equidigital number, since it uses as much as digits as its factorization.
106849536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328 (or 291 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 42.
The square root of 106849536 is about 10336.8049222185. The cubic root of 106849536 is about 474.5233053288.
The spelling of 106849536 in words is "one hundred six million, eight hundred forty-nine thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •