Base | Representation |
---|---|
bin | 110001110111110100… |
… | …1100001100010100000 |
3 | 101020102222021100100121 |
4 | 1203233221201202200 |
5 | 3223320030330013 |
6 | 121111225330024 |
7 | 10511014514146 |
oct | 1435751414240 |
9 | 336388240317 |
10 | 107099855008 |
11 | 4146a092273 |
12 | 1890b636914 |
13 | a13a708193 |
14 | 527dd71596 |
15 | 2bbc6ca58d |
hex | 18efa618a0 |
107099855008 has 48 divisors (see below), whose sum is σ = 214806079656. Its totient is φ = 52550000640.
The previous prime is 107099854991. The next prime is 107099855011. The reversal of 107099855008 is 800558990701.
It can be written as a sum of positive squares in 4 ways, for example, as 65439779344 + 41660075664 = 255812^2 + 204108^2 .
It is a super-2 number, since 2×1070998550082 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 781860 + ... + 908572.
Almost surely, 2107099855008 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 107099855008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107403039828).
107099855008 is an abundant number, since it is smaller than the sum of its proper divisors (107706224648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107099855008 is a wasteful number, since it uses less digits than its factorization.
107099855008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127217 (or 127209 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 52.
The spelling of 107099855008 in words is "one hundred seven billion, ninety-nine million, eight hundred fifty-five thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •