Base | Representation |
---|---|
bin | 1100100001011… |
… | …11010010101001 |
3 | 21022200011022002 |
4 | 12100233102221 |
5 | 203343120210 |
6 | 14231340345 |
7 | 2413631012 |
oct | 620572251 |
9 | 238604262 |
10 | 105051305 |
11 | 54331667 |
12 | 2b2216b5 |
13 | 189c1a48 |
14 | dd48009 |
15 | 93514a5 |
hex | 642f4a9 |
105051305 has 8 divisors (see below), whose sum is σ = 126117000. Its totient is φ = 84004096.
The previous prime is 105051301. The next prime is 105051367. The reversal of 105051305 is 503150501.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 11812969 + 93238336 = 3437^2 + 9656^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 105051305 - 22 = 105051301 is a prime.
It is a super-2 number, since 2×1050513052 = 22071553364406050, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (105051301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17651 + ... + 22839.
It is an arithmetic number, because the mean of its divisors is an integer number (15764625).
Almost surely, 2105051305 is an apocalyptic number.
It is an amenable number.
105051305 is a deficient number, since it is larger than the sum of its proper divisors (21065695).
105051305 is an equidigital number, since it uses as much as digits as its factorization.
105051305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9243.
The product of its (nonzero) digits is 375, while the sum is 20.
The square root of 105051305 is about 10249.4538878908. The cubic root of 105051305 is about 471.8462240248.
The spelling of 105051305 in words is "one hundred five million, fifty-one thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •