Base | Representation |
---|---|
bin | 1100100100110… |
… | …00111000000000 |
3 | 21100111010112112 |
4 | 12102120320000 |
5 | 204000440101 |
6 | 14244514452 |
7 | 2420411606 |
oct | 622307000 |
9 | 240433475 |
10 | 105483776 |
11 | 545a7582 |
12 | 2b3aba28 |
13 | 18b13848 |
14 | 1001b876 |
15 | 93d96bb |
hex | 6498e00 |
105483776 has 40 divisors (see below), whose sum is σ = 223177680. Its totient is φ = 49635328.
The previous prime is 105483767. The next prime is 105483797. The reversal of 105483776 is 677384501.
It is a super-2 number, since 2×1054837762 = 22253653998436352, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2645 + ... + 14763.
It is an arithmetic number, because the mean of its divisors is an integer number (5579442).
Almost surely, 2105483776 is an apocalyptic number.
105483776 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 105483776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111588840).
105483776 is an abundant number, since it is smaller than the sum of its proper divisors (117693904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105483776 is an equidigital number, since it uses as much as digits as its factorization.
105483776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12154 (or 12138 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 41.
The square root of 105483776 is about 10270.5294897585. The cubic root of 105483776 is about 472.4928300658.
The spelling of 105483776 in words is "one hundred five million, four hundred eighty-three thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •