Base | Representation |
---|---|
bin | 1100100100111… |
… | …10011000000000 |
3 | 21100112021102220 |
4 | 12102132120000 |
5 | 204002200204 |
6 | 14245211040 |
7 | 2420534361 |
oct | 622363000 |
9 | 240467386 |
10 | 105506304 |
11 | 546124a2 |
12 | 2b400a80 |
13 | 18b20b87 |
14 | 10025b68 |
15 | 93e11d9 |
hex | 649e600 |
105506304 has 80 divisors (see below), whose sum is σ = 283575600. Its totient is φ = 34856960.
The previous prime is 105506293. The next prime is 105506309. The reversal of 105506304 is 403605501.
It is a super-2 number, since 2×1055063042 = 22263160367480832, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105506309) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 228634 + ... + 229094.
It is an arithmetic number, because the mean of its divisors is an integer number (3544695).
Almost surely, 2105506304 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105506304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141787800).
105506304 is an abundant number, since it is smaller than the sum of its proper divisors (178069296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105506304 is an equidigital number, since it uses as much as digits as its factorization.
105506304 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 631 (or 615 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 105506304 is about 10271.6261614216. The cubic root of 105506304 is about 472.5264641822.
The spelling of 105506304 in words is "one hundred five million, five hundred six thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •