Base | Representation |
---|---|
bin | 110000111011101001… |
… | …0101100001011000111 |
3 | 101001020020200201210121 |
4 | 1201313102230023013 |
5 | 3210201113301320 |
6 | 120135014002411 |
7 | 10406665251061 |
oct | 1416722541307 |
9 | 331206621717 |
10 | 105080603335 |
11 | 40623296634 |
12 | 18447346407 |
13 | 9ba82801c6 |
14 | 512bb04731 |
15 | 2b002b38aa |
hex | 18774ac2c7 |
105080603335 has 8 divisors (see below), whose sum is σ = 126098895600. Its totient is φ = 84063034944.
The previous prime is 105080603321. The next prime is 105080603347. The reversal of 105080603335 is 533306080501.
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-105080603335 is a prime.
It is a super-2 number, since 2×1050806033352 (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 105080603335.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 218604 + ... + 507886.
It is an arithmetic number, because the mean of its divisors is an integer number (15762361950).
Almost surely, 2105080603335 is an apocalyptic number.
105080603335 is a deficient number, since it is larger than the sum of its proper divisors (21018292265).
105080603335 is an equidigital number, since it uses as much as digits as its factorization.
105080603335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361937.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 105080603335 its reverse (533306080501), we get a palindrome (638386683836).
The spelling of 105080603335 in words is "one hundred five billion, eighty million, six hundred three thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •