Base | Representation |
---|---|
bin | 11000010001001001001111… |
… | …001001100000111101001110 |
3 | 111222220102001101100012100101 |
4 | 120101021033021200331032 |
5 | 102442141112342344300 |
6 | 1014555355532521314 |
7 | 31324036151246416 |
oct | 3021111711407516 |
9 | 458812041305311 |
10 | 106731265199950 |
11 | 3100a5257aa746 |
12 | bb7929892023a |
13 | 477293b179c91 |
14 | 1c4db6c3b3646 |
15 | c514d2552b6a |
hex | 61124f260f4e |
106731265199950 has 24 divisors (see below), whose sum is σ = 198520906739400. Its totient is φ = 42692344044000.
The previous prime is 106731265199947. The next prime is 106731265200029. The reversal of 106731265199950 is 59991562137601.
It is a super-2 number, since 2×1067312651999502 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9717976 + ... + 17547124.
It is an arithmetic number, because the mean of its divisors is an integer number (8271704447475).
Almost surely, 2106731265199950 is an apocalyptic number.
106731265199950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106731265199950 is a deficient number, since it is larger than the sum of its proper divisors (91789641539450).
106731265199950 is a wasteful number, since it uses less digits than its factorization.
106731265199950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8101812 (or 8101807 counting only the distinct ones).
The product of its (nonzero) digits is 27556200, while the sum is 64.
The spelling of 106731265199950 in words is "one hundred six trillion, seven hundred thirty-one billion, two hundred sixty-five million, one hundred ninety-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •