Base | Representation |
---|---|
bin | 11000010001100011000010… |
… | …111110110110000101000000 |
3 | 112000000001120202112210011001 |
4 | 120101203002332312011000 |
5 | 102443114341430114322 |
6 | 1015020221514101344 |
7 | 31326040002251263 |
oct | 3021430276660500 |
9 | 460001522483131 |
10 | 106758978363712 |
11 | 310202570a3874 |
12 | bb82731a1a854 |
13 | 477543682882c |
14 | 1c5123ac18cda |
15 | c520a550a827 |
hex | 6118c2fb6140 |
106758978363712 has 28 divisors (see below), whose sum is σ = 211850380707840. Its totient is φ = 53379354878336.
The previous prime is 106758978363689. The next prime is 106758978363721. The reversal of 106758978363712 is 217363879857601.
It is a super-2 number, since 2×1067589783637122 (a number of 29 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (73) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26574273 + ... + 30326719.
It is an arithmetic number, because the mean of its divisors is an integer number (7566085025280).
Almost surely, 2106758978363712 is an apocalyptic number.
It is an amenable number.
106758978363712 is a deficient number, since it is larger than the sum of its proper divisors (105091402344128).
106758978363712 is an equidigital number, since it uses as much as digits as its factorization.
106758978363712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4196998 (or 4196988 counting only the distinct ones).
The product of its (nonzero) digits is 640120320, while the sum is 73.
The spelling of 106758978363712 in words is "one hundred six trillion, seven hundred fifty-eight billion, nine hundred seventy-eight million, three hundred sixty-three thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •