Base | Representation |
---|---|
bin | 1100110001001… |
… | …00011100111000 |
3 | 21110112110010220 |
4 | 12120210130320 |
5 | 204404312211 |
6 | 14343340040 |
7 | 2440240503 |
oct | 630443470 |
9 | 243473126 |
10 | 107104056 |
11 | 55503954 |
12 | 2ba51620 |
13 | 192601a7 |
14 | 1032013a |
15 | 9609806 |
hex | 6624738 |
107104056 has 64 divisors (see below), whose sum is σ = 278256000. Its totient is φ = 34328448.
The previous prime is 107104037. The next prime is 107104061. The reversal of 107104056 is 650401701.
It is a super-2 number, since 2×1071040562 = 22942557623302272, 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 an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68370 + ... + 69918.
It is an arithmetic number, because the mean of its divisors is an integer number (4347750).
Almost surely, 2107104056 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 107104056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139128000).
107104056 is an abundant number, since it is smaller than the sum of its proper divisors (171151944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107104056 is a wasteful number, since it uses less digits than its factorization.
107104056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1668 (or 1664 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 107104056 is about 10349.1089471510. The cubic root of 107104056 is about 474.8997845829.
Adding to 107104056 its reverse (650401701), we get a palindrome (757505757).
The spelling of 107104056 in words is "one hundred seven million, one hundred four thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •