Base | Representation |
---|---|
bin | 1100100010101… |
… | …10110101110101 |
3 | 21022222101111221 |
4 | 12101112311311 |
5 | 203413311201 |
6 | 14235030341 |
7 | 2415204214 |
oct | 621266565 |
9 | 238871457 |
10 | 105213301 |
11 | 54432346 |
12 | 2b29b3b1 |
13 | 18a4a6bb |
14 | dd8b07b |
15 | 93844a1 |
hex | 6456d75 |
105213301 has 4 divisors (see below), whose sum is σ = 105300972. Its totient is φ = 105125632.
The previous prime is 105213299. The next prime is 105213313. The reversal of 105213301 is 103312501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 23328900 + 81884401 = 4830^2 + 9049^2 .
It is a cyclic number.
It is not a de Polignac number, because 105213301 - 21 = 105213299 is a prime.
It is a super-2 number, since 2×1052133012 = 22139677414633202, 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 (105213331) 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, 42010 + ... + 44443.
It is an arithmetic number, because the mean of its divisors is an integer number (26325243).
Almost surely, 2105213301 is an apocalyptic number.
It is an amenable number.
105213301 is a deficient number, since it is larger than the sum of its proper divisors (87671).
105213301 is an equidigital number, since it uses as much as digits as its factorization.
105213301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87670.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 105213301 is about 10257.3535085811. The cubic root of 105213301 is about 472.0886387323.
Adding to 105213301 its reverse (103312501), we get a palindrome (208525802).
The spelling of 105213301 in words is "one hundred five million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •