Base | Representation |
---|---|
bin | 11000110110110000010101… |
… | …101110101011101010110100 |
3 | 112100001111101002100111201220 |
4 | 120312300111232223222310 |
5 | 103312012401234124240 |
6 | 1024255003550150340 |
7 | 32011545135130161 |
oct | 3066602556535264 |
9 | 470044332314656 |
10 | 109315872176820 |
11 | 31916667a91a01 |
12 | 103161944b23b0 |
13 | 48cc59a284a2a |
14 | 1cdccb8a17068 |
15 | c98853d025d0 |
hex | 636c15babab4 |
109315872176820 has 48 divisors (see below), whose sum is σ = 306142424501760. Its totient is φ = 29145377113216.
The previous prime is 109315872176779. The next prime is 109315872176821. The reversal of 109315872176820 is 28671278513901.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109315872176821) 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, 172247307 + ... + 172880786.
It is an arithmetic number, because the mean of its divisors is an integer number (6377967177120).
Almost surely, 2109315872176820 is an apocalyptic number.
109315872176820 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
109315872176820 is an abundant number, since it is smaller than the sum of its proper divisors (196826552324940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109315872176820 is a wasteful number, since it uses less digits than its factorization.
109315872176820 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345133384 (or 345133382 counting only the distinct ones).
The product of its (nonzero) digits is 10160640, while the sum is 60.
The spelling of 109315872176820 in words is "one hundred nine trillion, three hundred fifteen billion, eight hundred seventy-two million, one hundred seventy-six thousand, eight hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •