Base | Representation |
---|---|
bin | 11000001000000001101101… |
… | …011011100001011011110111 |
3 | 111220200111210112110012102211 |
4 | 120020001231123201123313 |
5 | 102401404420222334032 |
6 | 1013355455133514251 |
7 | 31230545402105653 |
oct | 3010015533413367 |
9 | 456614715405384 |
10 | 106104708011767 |
11 | 3089883258a643 |
12 | ba97978042987 |
13 | 47288284bcb4a |
14 | 1c2b6d1037a63 |
15 | c40060e6d747 |
hex | 60806d6e16f7 |
106104708011767 has 2 divisors, whose sum is σ = 106104708011768. Its totient is φ = 106104708011766.
The previous prime is 106104708011761. The next prime is 106104708011791. The reversal of 106104708011767 is 767110807401601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 106104708011767 - 223 = 106104699623159 is a prime.
It is a super-2 number, since 2×1061047080117672 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106104708011767.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106104708011761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53052354005883 + 53052354005884.
It is an arithmetic number, because the mean of its divisors is an integer number (53052354005884).
Almost surely, 2106104708011767 is an apocalyptic number.
106104708011767 is a deficient number, since it is larger than the sum of its proper divisors (1).
106104708011767 is an equidigital number, since it uses as much as digits as its factorization.
106104708011767 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 395136, while the sum is 49.
The spelling of 106104708011767 in words is "one hundred six trillion, one hundred four billion, seven hundred eight million, eleven thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •