Base | Representation |
---|---|
bin | 1100100101101… |
… | …01100000011101 |
3 | 21100201002102010 |
4 | 12102311200131 |
5 | 204013213203 |
6 | 14251221433 |
7 | 2421410535 |
oct | 622654035 |
9 | 240632363 |
10 | 105601053 |
11 | 546776a8 |
12 | 2b447879 |
13 | 18b5503c |
14 | 1004c4c5 |
15 | 940e303 |
hex | 64b581d |
105601053 has 8 divisors (see below), whose sum is σ = 142093600. Its totient is φ = 69754608.
The previous prime is 105601051. The next prime is 105601063. The reversal of 105601053 is 350106501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105601053 - 21 = 105601051 is a prime.
It is a super-2 number, since 2×1056010532 = 22303164789417618, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105601051) 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, 161143 + ... + 161796.
It is an arithmetic number, because the mean of its divisors is an integer number (17761700).
Almost surely, 2105601053 is an apocalyptic number.
It is an amenable number.
105601053 is a deficient number, since it is larger than the sum of its proper divisors (36492547).
105601053 is a wasteful number, since it uses less digits than its factorization.
105601053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323051.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 105601053 is about 10276.2372977661. The cubic root of 105601053 is about 472.6678712601.
Adding to 105601053 its reverse (350106501), we get a palindrome (455707554).
The spelling of 105601053 in words is "one hundred five million, six hundred one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •