Base | Representation |
---|---|
bin | 110001111110011110… |
… | …0111000000000111011 |
3 | 101021000112012220002201 |
4 | 1203330330320000323 |
5 | 3224244144002421 |
6 | 121145321011031 |
7 | 10516364500615 |
oct | 1437474700073 |
9 | 337015186081 |
10 | 107323031611 |
11 | 41574065144 |
12 | 18972323a77 |
13 | a174a18743 |
14 | 52a1867db5 |
15 | 2bd20b1b91 |
hex | 18fcf3803b |
107323031611 has 8 divisors (see below), whose sum is σ = 107937452880. Its totient is φ = 106708775712.
The previous prime is 107323031593. The next prime is 107323031639. The reversal of 107323031611 is 116130323701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 107323031611 - 217 = 107322900539 is a prime.
It is a super-2 number, since 2×1073230316112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 107323031611.
It is not an unprimeable number, because it can be changed into a prime (107323031681) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1404261 + ... + 1478713.
It is an arithmetic number, because the mean of its divisors is an integer number (13492181610).
Almost surely, 2107323031611 is an apocalyptic number.
107323031611 is a deficient number, since it is larger than the sum of its proper divisors (614421269).
107323031611 is an equidigital number, since it uses as much as digits as its factorization.
107323031611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82685.
The product of its (nonzero) digits is 2268, while the sum is 28.
It can be divided in two parts, 1073230 and 31611, that added together give a triangular number (1104841 = T1486).
The spelling of 107323031611 in words is "one hundred seven billion, three hundred twenty-three million, thirty-one thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •