Base | Representation |
---|---|
bin | 1100100101001… |
… | …01011010110000 |
3 | 21100120202000100 |
4 | 12102211122300 |
5 | 204004111102 |
6 | 14245552400 |
7 | 2421014442 |
oct | 622453260 |
9 | 240522010 |
10 | 105535152 |
11 | 54632138 |
12 | 2b415700 |
13 | 18b31048 |
14 | 10032492 |
15 | 93e9a1c |
hex | 64a56b0 |
105535152 has 60 divisors (see below), whose sum is σ = 299122720. Its totient is φ = 34729344.
The previous prime is 105535123. The next prime is 105535153. The reversal of 105535152 is 251535501.
105535152 is a `hidden beast` number, since 10 + 553 + 51 + 52 = 666.
It is a super-2 number, since 2×1055351522 = 22275336615326208, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105535153) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6738 + ... + 16014.
Almost surely, 2105535152 is an apocalyptic number.
105535152 is a gapful number since it is divisible by the number (12) 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 105535152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149561360).
105535152 is an abundant number, since it is smaller than the sum of its proper divisors (193587568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105535152 is a wasteful number, since it uses less digits than its factorization.
105535152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9370 (or 9361 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 105535152 is about 10273.0303221591. The cubic root of 105535152 is about 472.5695270158.
The spelling of 105535152 in words is "one hundred five million, five hundred thirty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •