Base | Representation |
---|---|
bin | 1100100001001… |
… | …01110001011001 |
3 | 21022121011210221 |
4 | 12100211301121 |
5 | 203340343223 |
6 | 14230440041 |
7 | 2413406230 |
oct | 620456131 |
9 | 238534727 |
10 | 105012313 |
11 | 5430533a |
12 | 2b203021 |
13 | 189aa083 |
14 | dd37b17 |
15 | 9344b5d |
hex | 6425c59 |
105012313 has 4 divisors (see below), whose sum is σ = 120014080. Its totient is φ = 90010548.
The previous prime is 105012289. The next prime is 105012317. The reversal of 105012313 is 313210501.
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, and also an emirpimes, since its reverse is a distinct semiprime: 313210501 = 17489 ⋅17909.
It is a cyclic number.
It is not a de Polignac number, because 105012313 - 29 = 105011801 is a prime.
It is a super-2 number, since 2×1050123132 = 22055171763219938, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105012317) 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, 7500873 + ... + 7500886.
It is an arithmetic number, because the mean of its divisors is an integer number (30003520).
Almost surely, 2105012313 is an apocalyptic number.
It is an amenable number.
105012313 is a deficient number, since it is larger than the sum of its proper divisors (15001767).
105012313 is an equidigital number, since it uses as much as digits as its factorization.
105012313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15001766.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 105012313 is about 10247.5515612267. The cubic root of 105012313 is about 471.7878382524.
Adding to 105012313 its reverse (313210501), we get a palindrome (418222814).
The spelling of 105012313 in words is "one hundred five million, twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •