Base | Representation |
---|---|
bin | 110010000110111011… |
… | …1111110101000000000 |
3 | 101021202022110222111200 |
4 | 1210031313332220000 |
5 | 3230334340220030 |
6 | 121233422341200 |
7 | 10526413034214 |
oct | 1441567765000 |
9 | 337668428450 |
10 | 107606960640 |
11 | 416aa362233 |
12 | 18a3142a800 |
13 | a1bb7aa59a |
14 | 52cb456944 |
15 | 2bebe98d60 |
hex | 190ddfea00 |
107606960640 has 120 divisors (see below), whose sum is σ = 372673248948. Its totient is φ = 28695183360.
The previous prime is 107606960627. The next prime is 107606960653. The reversal of 107606960640 is 46069606701.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (107606960627) and next prime (107606960653).
It can be written as a sum of positive squares in 2 ways, for example, as 107447595264 + 159365376 = 327792^2 + 12624^2 .
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2312181 + ... + 2358260.
Almost surely, 2107606960640 is an apocalyptic number.
107606960640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107606960640 is an abundant number, since it is smaller than the sum of its proper divisors (265066288308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107606960640 is an equidigital number, since it uses as much as digits as its factorization.
107606960640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4670470 (or 4670451 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 45.
The spelling of 107606960640 in words is "one hundred seven billion, six hundred six million, nine hundred sixty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •