Base | Representation |
---|---|
bin | 110001010000010010… |
… | …0111011110110010001 |
3 | 101010000112000221010022 |
4 | 1202200210323312101 |
5 | 3213110423030420 |
6 | 120331435513225 |
7 | 10433105543642 |
oct | 1424044736621 |
9 | 333015027108 |
10 | 105773251985 |
11 | 40949274835 |
12 | 185bb2b8815 |
13 | 9c8891748b |
14 | 5195ac76c9 |
15 | 2b40ed2c25 |
hex | 18a093bd91 |
105773251985 has 8 divisors (see below), whose sum is σ = 126933734760. Its totient is φ = 84614713344.
The previous prime is 105773251979. The next prime is 105773252029. The reversal of 105773251985 is 589152377501.
It is a Cunningham number, because it is equal to 3252282+1.
It can be written as a sum of positive squares in 4 ways, for example, as 1 + 105773251984 = 1^2 + 325228^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105773251985 - 232 = 101478284689 is a prime.
It is a super-2 number, since 2×1057732519852 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 363530 + ... + 586259.
It is an arithmetic number, because the mean of its divisors is an integer number (15866716845).
Almost surely, 2105773251985 is an apocalyptic number.
It is an amenable number.
105773251985 is a deficient number, since it is larger than the sum of its proper divisors (21160482775).
105773251985 is an equidigital number, since it uses as much as digits as its factorization.
105773251985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 972067.
The product of its (nonzero) digits is 2646000, while the sum is 53.
The spelling of 105773251985 in words is "one hundred five billion, seven hundred seventy-three million, two hundred fifty-one thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •