Base | Representation |
---|---|
bin | 110001111111001110… |
… | …0000000011001000000 |
3 | 101021002021010212120221 |
4 | 1203332130000121000 |
5 | 3224322040011400 |
6 | 121152011312424 |
7 | 10520116454254 |
oct | 1437634003100 |
9 | 337067125527 |
10 | 107347969600 |
11 | 41587148453 |
12 | 1897a74b714 |
13 | a179c3a651 |
14 | 52a4cba264 |
15 | 2bd438ac1a |
hex | 18fe700640 |
107347969600 has 63 divisors (see below), whose sum is σ = 264175349601. Its totient is φ = 42933945600.
The previous prime is 107347969583. The next prime is 107347969613. The reversal of 107347969600 is 6969743701.
The square root of 107347969600 is 327640.
It is a perfect power (a square), and thus also a powerful number.
107347969600 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 38645269056 + 68702700544 = 196584^2 + 262112^2 .
It is a Duffinian number.
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, 13101505 + ... + 13109695.
Almost surely, 2107347969600 is an apocalyptic number.
107347969600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
107347969600 is the 327640-th square number.
It is an amenable number.
107347969600 is an abundant number, since it is smaller than the sum of its proper divisors (156827380001).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107347969600 is an frugal number, since it uses more digits than its factorization.
107347969600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16404 (or 8198 counting only the distinct ones).
The product of its (nonzero) digits is 1714608, while the sum is 52.
The spelling of 107347969600 in words is "one hundred seven billion, three hundred forty-seven million, nine hundred sixty-nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •