Base | Representation |
---|---|
bin | 11000010111001111010110… |
… | …011011110001010010100011 |
3 | 112001101110020221212001021220 |
4 | 120113033112123301102203 |
5 | 103021022000031043230 |
6 | 1015520033045550123 |
7 | 31366225344464343 |
oct | 3027172633612243 |
9 | 461343227761256 |
10 | 107150146737315 |
11 | 31161138486580 |
12 | 100264bb415343 |
13 | 47a32a5549826 |
14 | 1c661480b4d23 |
15 | c5c34b8d5d10 |
hex | 6173d66f14a3 |
107150146737315 has 32 divisors (see below), whose sum is σ = 193058798118912. Its totient is φ = 50275728672000.
The previous prime is 107150146737301. The next prime is 107150146737341. The reversal of 107150146737315 is 513737641051701.
It is not a de Polignac number, because 107150146737315 - 222 = 107150142543011 is a prime.
It is a super-4 number, since 4×1071501467373154 (a number of 57 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10474105026 + ... + 10474115255.
It is an arithmetic number, because the mean of its divisors is an integer number (6033087441216).
Almost surely, 2107150146737315 is an apocalyptic number.
107150146737315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
107150146737315 is a deficient number, since it is larger than the sum of its proper divisors (85908651381597).
107150146737315 is a wasteful number, since it uses less digits than its factorization.
107150146737315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20948220331.
The product of its (nonzero) digits is 1852200, while the sum is 51.
The spelling of 107150146737315 in words is "one hundred seven trillion, one hundred fifty billion, one hundred forty-six million, seven hundred thirty-seven thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •