Base | Representation |
---|---|
bin | 110010010010010010… |
… | …0110001001001001101 |
3 | 101022201212002122210100 |
4 | 1210210210301021031 |
5 | 3232124334110103 |
6 | 121335305201313 |
7 | 10542016106025 |
oct | 1444444611115 |
9 | 338655078710 |
10 | 107987800653 |
11 | 41885330a47 |
12 | 18b18a90239 |
13 | a24c670bc5 |
14 | 5325c70a85 |
15 | 2c206255a3 |
hex | 192493124d |
107987800653 has 12 divisors (see below), whose sum is σ = 156178100988. Its totient is φ = 71901533760.
The previous prime is 107987800651. The next prime is 107987800709. The reversal of 107987800653 is 356008789701.
It can be written as a sum of positive squares in 2 ways, for example, as 91211852169 + 16775948484 = 302013^2 + 129522^2 .
It is not a de Polignac number, because 107987800653 - 21 = 107987800651 is a prime.
It is a super-2 number, since 2×1079878006532 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 107987800653.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107987800651) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7520208 + ... + 7534553.
It is an arithmetic number, because the mean of its divisors is an integer number (13014841749).
Almost surely, 2107987800653 is an apocalyptic number.
It is an amenable number.
107987800653 is a deficient number, since it is larger than the sum of its proper divisors (48190300335).
107987800653 is a wasteful number, since it uses less digits than its factorization.
107987800653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15055564 (or 15055561 counting only the distinct ones).
The product of its (nonzero) digits is 2540160, while the sum is 54.
The spelling of 107987800653 in words is "one hundred seven billion, nine hundred eighty-seven million, eight hundred thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •