Base | Representation |
---|---|
bin | 10000000111001011000… |
… | …111011101110110100110 |
3 | 10220211220200002120011200 |
4 | 100013023013131312212 |
5 | 121120033331432311 |
6 | 2204351445343330 |
7 | 142664542332321 |
oct | 20071307356646 |
9 | 3824820076150 |
10 | 1107214327206 |
11 | 397626693889 |
12 | 15a703a07b46 |
13 | 80543613840 |
14 | 3b8376957b8 |
15 | 1dc04004556 |
hex | 101cb1ddda6 |
1107214327206 has 96 divisors (see below), whose sum is σ = 2726768684640. Its totient is φ = 321884969472.
The previous prime is 1107214327201. The next prime is 1107214327217. The reversal of 1107214327206 is 6027234127011.
1107214327206 is a `hidden beast` number, since 1 + 10 + 7 + 2 + 1 + 432 + 7 + 206 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1107214327201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1324530 + ... + 1992186.
It is an arithmetic number, because the mean of its divisors is an integer number (28403840465).
Almost surely, 21107214327206 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1107214327206, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1363384342320).
1107214327206 is an abundant number, since it is smaller than the sum of its proper divisors (1619554357434).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1107214327206 is a wasteful number, since it uses less digits than its factorization.
1107214327206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668070 (or 668067 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 36.
The spelling of 1107214327206 in words is "one trillion, one hundred seven billion, two hundred fourteen million, three hundred twenty-seven thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •