Base | Representation |
---|---|
bin | 1100100100000… |
… | …11100100000000 |
3 | 21100022200210100 |
4 | 12102003210000 |
5 | 203440141410 |
6 | 14243002400 |
7 | 2416566240 |
oct | 622034400 |
9 | 240280710 |
10 | 105396480 |
11 | 54547a32 |
12 | 2b369400 |
13 | 18ab2ba7 |
14 | ddd7b20 |
15 | 93bd8c0 |
hex | 6483900 |
105396480 has 216 divisors, whose sum is σ = 417074112. Its totient is φ = 24072192.
The previous prime is 105396449. The next prime is 105396493. The reversal of 105396480 is 84693501.
105396480 is a `hidden beast` number, since 1 + 0 + 5 + 3 + 9 + 648 + 0 = 666.
It is a super-2 number, since 2×1053964802 = 22216835992780800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 79987 + ... + 81293.
Almost surely, 2105396480 is an apocalyptic number.
105396480 is a gapful number since it is divisible by the number (10) 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 105396480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (208537056).
105396480 is an abundant number, since it is smaller than the sum of its proper divisors (311677632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105396480 is a wasteful number, since it uses less digits than its factorization.
105396480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1341 (or 1324 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 105396480 is about 10266.2787805514. The cubic root of 105396480 is about 472.3624526145.
The spelling of 105396480 in words is "one hundred five million, three hundred ninety-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •