Base | Representation |
---|---|
bin | 1100100110000… |
… | …00111000100000 |
3 | 21100210110022212 |
4 | 12103000320200 |
5 | 204021211043 |
6 | 14252221252 |
7 | 2421663431 |
oct | 623007040 |
9 | 240713285 |
10 | 105647648 |
11 | 546a9707 |
12 | 2b46a828 |
13 | 18b70302 |
14 | 10061488 |
15 | 941d018 |
hex | 64c0e20 |
105647648 has 54 divisors (see below), whose sum is σ = 220217319. Its totient is φ = 49887552.
The previous prime is 105647623. The next prime is 105647653. The reversal of 105647648 is 846746501.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 52823824 + 52823824 = 7268^2 + 7268^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=7268.
It is a super-2 number, since 2×1056476482 = 22322851055863808, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1337273 + ... + 1337351.
Almost surely, 2105647648 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 105647648
105647648 is an abundant number, since it is smaller than the sum of its proper divisors (114569671).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105647648 is an frugal number, since it uses more digits than its factorization.
105647648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214 (or 104 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 41.
The square root of 105647648 is about 10278.5041713277. The cubic root of 105647648 is about 472.7373804186.
The spelling of 105647648 in words is "one hundred five million, six hundred forty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •