Base | Representation |
---|---|
bin | 110001111101110111… |
… | …1001100111100110011 |
3 | 101020222002220102101211 |
4 | 1203323233030330303 |
5 | 3224223440421011 |
6 | 121143312340551 |
7 | 10516026434656 |
oct | 1437357147463 |
9 | 336862812354 |
10 | 107302670131 |
11 | 41563618278 |
12 | 18967544757 |
13 | a170739927 |
14 | 529cc8789d |
15 | 2bd03ddb21 |
hex | 18fbbccf33 |
107302670131 has 8 divisors (see below), whose sum is σ = 108753297840. Its totient is φ = 105857486592.
The previous prime is 107302670099. The next prime is 107302670227. The reversal of 107302670131 is 131076203701.
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 107302670131 - 25 = 107302670099 is a prime.
It is a super-2 number, since 2×1073026701312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 107302670093 and 107302670102.
It is not an unprimeable number, because it can be changed into a prime (107302670731) 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, 1321350 + ... + 1400203.
It is an arithmetic number, because the mean of its divisors is an integer number (13594162230).
Almost surely, 2107302670131 is an apocalyptic number.
107302670131 is a deficient number, since it is larger than the sum of its proper divisors (1450627709).
107302670131 is an equidigital number, since it uses as much as digits as its factorization.
107302670131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2722085.
The product of its (nonzero) digits is 5292, while the sum is 31.
Adding to 107302670131 its reverse (131076203701), we get a palindrome (238378873832).
The spelling of 107302670131 in words is "one hundred seven billion, three hundred two million, six hundred seventy thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •