Base | Representation |
---|---|
bin | 11000110110000110110000… |
… | …000011001100000000000000 |
3 | 112022220020002222000022202110 |
4 | 120312012300003030000000 |
5 | 103310244422422300021 |
6 | 1024222300502215320 |
7 | 32005404420043230 |
oct | 3066066003140000 |
9 | 468806088008673 |
10 | 109271216603136 |
11 | 318a9732094505 |
12 | 103095b1424540 |
13 | 48c8301827b53 |
14 | 1cdaa80003cc0 |
15 | c975dd74b476 |
hex | 6361b00cc000 |
109271216603136 has 240 divisors, whose sum is σ = 334732505859584. Its totient is φ = 31058565267456.
The previous prime is 109271216603119. The next prime is 109271216603177. The reversal of 109271216603136 is 631306612172901.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65581581 + ... + 67227123.
Almost surely, 2109271216603136 is an apocalyptic number.
109271216603136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 109271216603136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167366252929792).
109271216603136 is an abundant number, since it is smaller than the sum of its proper divisors (225461289256448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109271216603136 is an equidigital number, since it uses as much as digits as its factorization.
109271216603136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1645774 (or 1645748 counting only the distinct ones).
The product of its (nonzero) digits is 489888, while the sum is 48.
The spelling of 109271216603136 in words is "one hundred nine trillion, two hundred seventy-one billion, two hundred sixteen million, six hundred three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •