Base | Representation |
---|---|
bin | 1100100001000… |
… | …11000001011101 |
3 | 21022120121100220 |
4 | 12100203001131 |
5 | 203340013203 |
6 | 14230311553 |
7 | 2413331343 |
oct | 620430135 |
9 | 238517326 |
10 | 105001053 |
11 | 542a7933 |
12 | 2b1b85b9 |
13 | 189a4c01 |
14 | dd33993 |
15 | 9341653 |
hex | 642305d |
105001053 has 8 divisors (see below), whose sum is σ = 140049600. Its totient is φ = 69976608.
The previous prime is 105001051. The next prime is 105001073. The reversal of 105001053 is 350100501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105001053 - 21 = 105001051 is a prime.
It is a super-2 number, since 2×1050010532 = 22050442262217618, which contains 22 as substring.
105001053 is a modest number, since divided by 1053 gives 105 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105001051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11088 + ... + 18246.
It is an arithmetic number, because the mean of its divisors is an integer number (17506200).
Almost surely, 2105001053 is an apocalyptic number.
It is an amenable number.
105001053 is a deficient number, since it is larger than the sum of its proper divisors (35048547).
105001053 is an equidigital number, since it uses as much as digits as its factorization.
105001053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12051.
The product of its (nonzero) digits is 75, while the sum is 15.
The square root of 105001053 is about 10247.0021469696. The cubic root of 105001053 is about 471.7709750841.
Adding to 105001053 its reverse (350100501), we get a palindrome (455101554).
The spelling of 105001053 in words is "one hundred five million, one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •