Base | Representation |
---|---|
bin | 11000001111100111001111… |
… | …110111100001001011111001 |
3 | 111222112100110210102201220220 |
4 | 120033213033313201023321 |
5 | 102433430122420421021 |
6 | 1014435155330010253 |
7 | 31313322634465254 |
oct | 3017471767411371 |
9 | 458470423381826 |
10 | 106626050560761 |
11 | 30a79943895a86 |
12 | bb60a14716989 |
13 | 4765a411ca324 |
14 | 1c48a2a97c09b |
15 | c4d8c5614cc6 |
hex | 60f9cfde12f9 |
106626050560761 has 8 divisors (see below), whose sum is σ = 143122215518400. Its totient is φ = 70606959655152.
The previous prime is 106626050560717. The next prime is 106626050560769. The reversal of 106626050560761 is 167065050626601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106626050560761 - 225 = 106626017006329 is a prime.
It is a super-2 number, since 2×1066260505607612 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106626050560769) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119268512485 + ... + 119268513378.
It is an arithmetic number, because the mean of its divisors is an integer number (17890276939800).
Almost surely, 2106626050560761 is an apocalyptic number.
It is an amenable number.
106626050560761 is a deficient number, since it is larger than the sum of its proper divisors (36496164957639).
106626050560761 is a wasteful number, since it uses less digits than its factorization.
106626050560761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238537026015.
The product of its (nonzero) digits is 2721600, while the sum is 51.
The spelling of 106626050560761 in words is "one hundred six trillion, six hundred twenty-six billion, fifty million, five hundred sixty thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •