Base | Representation |
---|---|
bin | 11000001000011100101011… |
… | …011111011000000011000101 |
3 | 111220210021112200221122202011 |
4 | 120020130223133120003011 |
5 | 102402343222110343314 |
6 | 1013421044442414221 |
7 | 31232622124135525 |
oct | 3010345337300305 |
9 | 456707480848664 |
10 | 106133666496709 |
11 | 308aa042924a25 |
12 | baa14ba201371 |
13 | 472b491b70737 |
14 | 1c2cc7b009685 |
15 | c40ba84154c4 |
hex | 60872b7d80c5 |
106133666496709 has 8 divisors (see below), whose sum is σ = 106189324164000. Its totient is φ = 106078011090576.
The previous prime is 106133666496653. The next prime is 106133666496749. The reversal of 106133666496709 is 907694666331601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106133666496709 - 27 = 106133666496581 is a prime.
It is a super-2 number, since 2×1061336664967092 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106133666496749) 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, 97814967 + ... + 98894059.
It is an arithmetic number, because the mean of its divisors is an integer number (13273665520500).
Almost surely, 2106133666496709 is an apocalyptic number.
It is an amenable number.
106133666496709 is a deficient number, since it is larger than the sum of its proper divisors (55657667291).
106133666496709 is a wasteful number, since it uses less digits than its factorization.
106133666496709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1130579.
The product of its (nonzero) digits is 158723712, while the sum is 67.
The spelling of 106133666496709 in words is "one hundred six trillion, one hundred thirty-three billion, six hundred sixty-six million, four hundred ninety-six thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •