Base | Representation |
---|---|
bin | 110001111011100011… |
… | …1011001100011100101 |
3 | 101020202200222211102020 |
4 | 1203313013121203211 |
5 | 3224044113032031 |
6 | 121131502333353 |
7 | 10514065354056 |
oct | 1436707314345 |
9 | 336680884366 |
10 | 107225127141 |
11 | 41523875060 |
12 | 1894558a259 |
13 | a15a6599c2 |
14 | 529286072d |
15 | 2bc86c3096 |
hex | 18f71d98e5 |
107225127141 has 16 divisors (see below), whose sum is σ = 156051674688. Its totient is φ = 64948320000.
The previous prime is 107225127137. The next prime is 107225127143. The reversal of 107225127141 is 141721522701.
It is not a de Polignac number, because 107225127141 - 22 = 107225127137 is a prime.
It is a super-2 number, since 2×1072251271412 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107225127143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 855610 + ... + 972891.
It is an arithmetic number, because the mean of its divisors is an integer number (9753229668).
Almost surely, 2107225127141 is an apocalyptic number.
107225127141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
107225127141 is a deficient number, since it is larger than the sum of its proper divisors (48826547547).
107225127141 is a wasteful number, since it uses less digits than its factorization.
107225127141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1830292.
The product of its (nonzero) digits is 7840, while the sum is 33.
Adding to 107225127141 its reverse (141721522701), we get a palindrome (248946649842).
The spelling of 107225127141 in words is "one hundred seven billion, two hundred twenty-five million, one hundred twenty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •