Base | Representation |
---|---|
bin | 1100110000101… |
… | …00000001000100 |
3 | 21110102000210201 |
4 | 12120110001010 |
5 | 204400133430 |
6 | 14342100244 |
7 | 2436540316 |
oct | 630240104 |
9 | 243360721 |
10 | 107036740 |
11 | 55468318 |
12 | 2ba1a684 |
13 | 19238665 |
14 | 103037b6 |
15 | 95e48ca |
hex | 6614044 |
107036740 has 24 divisors (see below), whose sum is σ = 227306520. Its totient is φ = 42332928.
The previous prime is 107036737. The next prime is 107036749. The reversal of 107036740 is 47630701.
It can be written as a sum of positive squares in 4 ways, for example, as 1522756 + 105513984 = 1234^2 + 10272^2 .
It is a super-2 number, since 2×1070367402 = 22913727419655200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 107036699 and 107036708.
It is not an unprimeable number, because it can be changed into a prime (107036749) 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, 28287 + ... + 31846.
It is an arithmetic number, because the mean of its divisors is an integer number (9471105).
Almost surely, 2107036740 is an apocalyptic number.
107036740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107036740 is an abundant number, since it is smaller than the sum of its proper divisors (120269780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107036740 is a wasteful number, since it uses less digits than its factorization.
107036740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60231 (or 60229 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 28.
The square root of 107036740 is about 10345.8561753003. The cubic root of 107036740 is about 474.8002705996.
The spelling of 107036740 in words is "one hundred seven million, thirty-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •