Base | Representation |
---|---|
bin | 1100100001000… |
… | …11101111110101 |
3 | 21022120202102211 |
4 | 12100203233311 |
5 | 203340112041 |
6 | 14230333421 |
7 | 2413343113 |
oct | 620435765 |
9 | 238522384 |
10 | 105004021 |
11 | 542aa091 |
12 | 2b1ba271 |
13 | 189a6375 |
14 | dd34ab3 |
15 | 9342481 |
hex | 6423bf5 |
105004021 has 4 divisors (see below), whose sum is σ = 105119200. Its totient is φ = 104888844.
The previous prime is 105004001. The next prime is 105004027. The reversal of 105004021 is 120400501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105004021 - 25 = 105003989 is a prime.
It is a super-2 number, since 2×1050040212 = 22051688852336882, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105003992 and 105004010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105004027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56211 + ... + 58048.
It is an arithmetic number, because the mean of its divisors is an integer number (26279800).
Almost surely, 2105004021 is an apocalyptic number.
It is an amenable number.
105004021 is a deficient number, since it is larger than the sum of its proper divisors (115179).
105004021 is an equidigital number, since it uses as much as digits as its factorization.
105004021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115178.
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 105004021 is about 10247.1469687909. The cubic root of 105004021 is about 471.7754201286.
Adding to 105004021 its reverse (120400501), we get a palindrome (225404522).
The spelling of 105004021 in words is "one hundred five million, four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •