Base | Representation |
---|---|
bin | 11000001001010110100010… |
… | …001001010111011101110001 |
3 | 111221000012212222011220012101 |
4 | 120021112202021113131301 |
5 | 102404402432402224001 |
6 | 1013505400531300401 |
7 | 31240251410505163 |
oct | 3011264211273561 |
9 | 457005788156171 |
10 | 106195786758001 |
11 | 30923420119746 |
12 | bab155614a701 |
13 | 47342b1960ab5 |
14 | 1c31c91300933 |
15 | c425e1d83a01 |
hex | 6095a2257771 |
106195786758001 has 2 divisors, whose sum is σ = 106195786758002. Its totient is φ = 106195786758000.
The previous prime is 106195786757909. The next prime is 106195786758007. The reversal of 106195786758001 is 100857687591601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99887531640625 + 6308255117376 = 9994375^2 + 2511624^2 .
It is a cyclic number.
It is not a de Polignac number, because 106195786758001 - 217 = 106195786626929 is a prime.
It is a super-3 number, since 3×1061957867580013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (106195786758007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53097893379000 + 53097893379001.
It is an arithmetic number, because the mean of its divisors is an integer number (53097893379001).
Almost surely, 2106195786758001 is an apocalyptic number.
It is an amenable number.
106195786758001 is a deficient number, since it is larger than the sum of its proper divisors (1).
106195786758001 is an equidigital number, since it uses as much as digits as its factorization.
106195786758001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25401600, while the sum is 64.
The spelling of 106195786758001 in words is "one hundred six trillion, one hundred ninety-five billion, seven hundred eighty-six million, seven hundred fifty-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •