Base | Representation |
---|---|
bin | 11000010000110010010111… |
… | …011001011011000111101000 |
3 | 111222211001122220202002222012 |
4 | 120100302113121123013220 |
5 | 102441240314111313440 |
6 | 1014540215032415052 |
7 | 31322206454413622 |
oct | 3020622731330750 |
9 | 458731586662865 |
10 | 106706707526120 |
11 | 31000073618939 |
12 | bb74584547488 |
13 | 4770526484630 |
14 | 1c4c8bca8bc12 |
15 | c50a46604e65 |
hex | 610c9765b1e8 |
106706707526120 has 64 divisors (see below), whose sum is σ = 258569624960640. Its totient is φ = 39397713696000.
The previous prime is 106706707526077. The next prime is 106706707526123. The reversal of 106706707526120 is 21625707607601.
It is a super-2 number, since 2×1067067075261202 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106706707526123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7805195 + ... + 16563045.
It is an arithmetic number, because the mean of its divisors is an integer number (4040150390010).
Almost surely, 2106706707526120 is an apocalyptic number.
106706707526120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106706707526120 is an abundant number, since it is smaller than the sum of its proper divisors (151862917434520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106706707526120 is a wasteful number, since it uses less digits than its factorization.
106706707526120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8781306 (or 8781302 counting only the distinct ones).
The product of its (nonzero) digits is 1481760, while the sum is 50.
The spelling of 106706707526120 in words is "one hundred six trillion, seven hundred six billion, seven hundred seven million, five hundred twenty-six thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •