Base | Representation |
---|---|
bin | 1100110000111… |
… | …01110101110010 |
3 | 21110111002000000 |
4 | 12120131311302 |
5 | 204402430403 |
6 | 14343010430 |
7 | 2440065531 |
oct | 630356562 |
9 | 243432000 |
10 | 107076978 |
11 | 55495578 |
12 | 2ba39a16 |
13 | 19250a78 |
14 | 10314318 |
15 | 96017a3 |
hex | 661dd72 |
107076978 has 42 divisors (see below), whose sum is σ = 241704927. Its totient is φ = 35560620.
The previous prime is 107076971. The next prime is 107077043. The reversal of 107076978 is 879670701.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 53538489 + 53538489 = 7317^2 + 7317^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=7317.
It is a super-2 number, since 2×1070769782 = 22930958435224968, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (107076971) by changing a digit.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 394983 + ... + 395253.
Almost surely, 2107076978 is an apocalyptic number.
107076978 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 107076978
107076978 is an abundant number, since it is smaller than the sum of its proper divisors (134627949).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107076978 is an frugal number, since it uses more digits than its factorization.
107076978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562 (or 276 counting only the distinct ones).
The product of its (nonzero) digits is 148176, while the sum is 45.
The square root of 107076978 is about 10347.8006358839. The cubic root of 107076978 is about 474.8597598920.
The spelling of 107076978 in words is "one hundred seven million, seventy-six thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •