Base | Representation |
---|---|
bin | 1100110011101… |
… | …11100001000111 |
3 | 21111011201212100 |
4 | 12121313201013 |
5 | 210001204140 |
6 | 14354523143 |
7 | 2443155450 |
oct | 631674107 |
9 | 244151770 |
10 | 107444295 |
11 | 55716542 |
12 | 2bb964b3 |
13 | 1934c00a |
14 | 103ac127 |
15 | 9675530 |
hex | 6677847 |
107444295 has 48 divisors (see below), whose sum is σ = 219727872. Its totient is φ = 47528640.
The previous prime is 107444291. The next prime is 107444317. The reversal of 107444295 is 592444701.
It is a happy number.
It is not a de Polignac number, because 107444295 - 22 = 107444291 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107444291) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4264 + ... + 15266.
It is an arithmetic number, because the mean of its divisors is an integer number (4577664).
Almost surely, 2107444295 is an apocalyptic number.
107444295 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
107444295 is an abundant number, since it is smaller than the sum of its proper divisors (112283577).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107444295 is a wasteful number, since it uses less digits than its factorization.
107444295 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11052 (or 11049 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 107444295 is about 10365.5339949276. The cubic root of 107444295 is about 475.4021266912.
Adding to 107444295 its reverse (592444701), we get a palindrome (699888996).
It can be divided in two parts, 1074 and 44295, that added together give a square (45369 = 2132).
The spelling of 107444295 in words is "one hundred seven million, four hundred forty-four thousand, two hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •