Base | Representation |
---|---|
bin | 1100100101001… |
… | …00101001101101 |
3 | 21100120120201002 |
4 | 12102210221231 |
5 | 204004011023 |
6 | 14245530045 |
7 | 2421002336 |
oct | 622445155 |
9 | 240516632 |
10 | 105532013 |
11 | 5462a844 |
12 | 2b413925 |
13 | 18b2c7a2 |
14 | 1003128d |
15 | 93e8b28 |
hex | 64a4a6d |
105532013 has 8 divisors (see below), whose sum is σ = 107508000. Its totient is φ = 103564080.
The previous prime is 105532003. The next prime is 105532043. The reversal of 105532013 is 310235501.
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 105532013 - 26 = 105531949 is a prime.
It is a super-2 number, since 2×1055320132 = 22274011535664338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105532003) 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, 28706 + ... + 32172.
It is an arithmetic number, because the mean of its divisors is an integer number (13438500).
Almost surely, 2105532013 is an apocalyptic number.
It is an amenable number.
105532013 is a deficient number, since it is larger than the sum of its proper divisors (1975987).
105532013 is an equidigital number, since it uses as much as digits as its factorization.
105532013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4027.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 105532013 is about 10272.8775423442. The cubic root of 105532013 is about 472.5648416561.
Adding to 105532013 its reverse (310235501), we get a palindrome (415767514).
The spelling of 105532013 in words is "one hundred five million, five hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •