Base | Representation |
---|---|
bin | 110010000000111110… |
… | …1010110110110101100 |
3 | 101021020101022011110010 |
4 | 1210001331112312230 |
5 | 3224432200402022 |
6 | 121201521413220 |
7 | 10521434545002 |
oct | 1440175266654 |
9 | 337211264403 |
10 | 107407044012 |
11 | 41607526984 |
12 | 1899649a210 |
13 | a189252218 |
14 | 52aca96a72 |
15 | 2bd965950c |
hex | 1901f56dac |
107407044012 has 48 divisors (see below), whose sum is σ = 252982517760. Its totient is φ = 35465213952.
The previous prime is 107407044011. The next prime is 107407044037. The reversal of 107407044012 is 210440704701.
It is a super-2 number, since 2×1074070440122 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (107407044011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 931564 + ... + 1040492.
It is an arithmetic number, because the mean of its divisors is an integer number (5270469120).
Almost surely, 2107407044012 is an apocalyptic number.
107407044012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
107407044012 is an abundant number, since it is smaller than the sum of its proper divisors (145575473748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107407044012 is a wasteful number, since it uses less digits than its factorization.
107407044012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109710 (or 109708 counting only the distinct ones).
The product of its (nonzero) digits is 6272, while the sum is 30.
Adding to 107407044012 its reverse (210440704701), we get a palindrome (317847748713).
The spelling of 107407044012 in words is "one hundred seven billion, four hundred seven million, forty-four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •