Base | Representation |
---|---|
bin | 11000010101110011001101… |
… | …011000110100001110100110 |
3 | 112001000222212221021122010110 |
4 | 120111303031120310032212 |
5 | 103012411334421021131 |
6 | 1015402351451433450 |
7 | 31356123540302556 |
oct | 3025631530641646 |
9 | 461028787248113 |
10 | 107051210720166 |
11 | 311231886a5549 |
12 | 1000b2a9a55886 |
13 | 4796b692ba04b |
14 | 1c61440499166 |
15 | c599aacba646 |
hex | 615ccd6343a6 |
107051210720166 has 16 divisors (see below), whose sum is σ = 214115029995888. Its totient is φ = 35681635480800.
The previous prime is 107051210719841. The next prime is 107051210720191. The reversal of 107051210720166 is 661027012150701.
It is a super-2 number, since 2×1070512107201662 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 525246105 + ... + 525449876.
It is an arithmetic number, because the mean of its divisors is an integer number (13382189374743).
Almost surely, 2107051210720166 is an apocalyptic number.
107051210720166 is an abundant number, since it is smaller than the sum of its proper divisors (107063819275722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107051210720166 is a wasteful number, since it uses less digits than its factorization.
107051210720166 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1050712967.
The product of its (nonzero) digits is 35280, while the sum is 39.
Adding to 107051210720166 its reverse (661027012150701), we get a palindrome (768078222870867).
The spelling of 107051210720166 in words is "one hundred seven trillion, fifty-one billion, two hundred ten million, seven hundred twenty thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •