Base | Representation |
---|---|
bin | 110001110110100001… |
… | …1000101111011100100 |
3 | 101020022221011202122011 |
4 | 1203231003011323210 |
5 | 3223222343213040 |
6 | 121103030244004 |
7 | 10506644623012 |
oct | 1435503057344 |
9 | 336287152564 |
10 | 107056226020 |
11 | 414474a3157 |
12 | 188b8ab6604 |
13 | a131670903 |
14 | 52782558b2 |
15 | 2bb895d3ea |
hex | 18ed0c5ee4 |
107056226020 has 48 divisors (see below), whose sum is σ = 238226341248. Its totient is φ = 40272422400.
The previous prime is 107056225961. The next prime is 107056226027. The reversal of 107056226020 is 20622650701.
It is a super-2 number, since 2×1070562260202 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (107056226027) 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, 322195 + ... + 563845.
It is an arithmetic number, because the mean of its divisors is an integer number (4963048776).
Almost surely, 2107056226020 is an apocalyptic number.
107056226020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107056226020 is an abundant number, since it is smaller than the sum of its proper divisors (131170115228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107056226020 is a wasteful number, since it uses less digits than its factorization.
107056226020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242980 (or 242978 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 31.
Adding to 107056226020 its reverse (20622650701), we get a palindrome (127678876721).
The spelling of 107056226020 in words is "one hundred seven billion, fifty-six million, two hundred twenty-six thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •