Base | Representation |
---|---|
bin | 11000001101110111000010… |
… | …001010100111001001011001 |
3 | 111222002211110201012101011220 |
4 | 120031313002022213021121 |
5 | 102424441342232204401 |
6 | 1014303551325242253 |
7 | 31301526050306112 |
oct | 3015670212471131 |
9 | 458084421171156 |
10 | 106505561600601 |
11 | 30a32833a24959 |
12 | bb415a9103389 |
13 | 475757b924b27 |
14 | 1c42c7a715209 |
15 | c4a6c2777336 |
hex | 60ddc22a7259 |
106505561600601 has 4 divisors (see below), whose sum is σ = 142007415467472. Its totient is φ = 71003707733732.
The previous prime is 106505561600563. The next prime is 106505561600693. The reversal of 106505561600601 is 106006165505601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106505561600601 - 241 = 104306538345049 is a prime.
It is a super-2 number, since 2×1065055616006012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106505561600701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17750926933431 + ... + 17750926933436.
It is an arithmetic number, because the mean of its divisors is an integer number (35501853866868).
Almost surely, 2106505561600601 is an apocalyptic number.
It is an amenable number.
106505561600601 is a deficient number, since it is larger than the sum of its proper divisors (35501853866871).
106505561600601 is an equidigital number, since it uses as much as digits as its factorization.
106505561600601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35501853866870.
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 106505561600601 in words is "one hundred six trillion, five hundred five billion, five hundred sixty-one million, six hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •