Base | Representation |
---|---|
bin | 110000111011100000… |
… | …0010000010011101001 |
3 | 101001012220121012112110 |
4 | 1201313000100103221 |
5 | 3210143344124401 |
6 | 120134322232533 |
7 | 10406606212344 |
oct | 1416700202351 |
9 | 331186535473 |
10 | 105075770601 |
11 | 4062059573a |
12 | 184457b5749 |
13 | 9ba727a5b9 |
14 | 512b20745b |
15 | 2aeeb5b9d6 |
hex | 18770104e9 |
105075770601 has 8 divisors (see below), whose sum is σ = 142074281664. Its totient is φ = 69063886640.
The previous prime is 105075770479. The next prime is 105075770621. The reversal of 105075770601 is 106077570501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105075770601 is a prime.
It is a super-2 number, since 2×1050757706012 (a number of 23 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 105075770601.
It is not an unprimeable number, because it can be changed into a prime (105075770621) 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, 246656526 + ... + 246656951.
It is an arithmetic number, because the mean of its divisors is an integer number (17759285208).
Almost surely, 2105075770601 is an apocalyptic number.
It is an amenable number.
105075770601 is a deficient number, since it is larger than the sum of its proper divisors (36998511063).
105075770601 is an equidigital number, since it uses as much as digits as its factorization.
105075770601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493313551.
The product of its (nonzero) digits is 51450, while the sum is 39.
The spelling of 105075770601 in words is "one hundred five billion, seventy-five million, seven hundred seventy thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •