Base | Representation |
---|---|
bin | 11000001101000010010100… |
… | …111100011001100011000000 |
3 | 111221220102101121222010011222 |
4 | 120031002110330121203000 |
5 | 102423024441342402222 |
6 | 1014221551515054212 |
7 | 31264453445354324 |
oct | 3015022474314300 |
9 | 457812347863158 |
10 | 106448968325312 |
11 | 30a10832556568 |
12 | bb32634141368 |
13 | 475212cc065a2 |
14 | 1c4022c49d984 |
15 | c48eae159542 |
hex | 60d094f198c0 |
106448968325312 has 224 divisors, whose sum is σ = 238429814630400. Its totient is φ = 46880508477440.
The previous prime is 106448968325309. The next prime is 106448968325317. The reversal of 106448968325312 is 213523869844601.
It is a super-2 number, since 2×1064489683253122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106448968325317) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3964714064 + ... + 3964740912.
Almost surely, 2106448968325312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106448968325312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119214907315200).
106448968325312 is an abundant number, since it is smaller than the sum of its proper divisors (131980846305088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106448968325312 is a wasteful number, since it uses less digits than its factorization.
106448968325312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30319 (or 30309 counting only the distinct ones).
The product of its (nonzero) digits is 59719680, while the sum is 62.
The spelling of 106448968325312 in words is "one hundred six trillion, four hundred forty-eight billion, nine hundred sixty-eight million, three hundred twenty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •