Base | Representation |
---|---|
bin | 110000111001100110… |
… | …0111111010101110001 |
3 | 101001001110121022212112 |
4 | 1201303030333111301 |
5 | 3210031033000423 |
6 | 120124123335105 |
7 | 10405203162506 |
oct | 1416314772561 |
9 | 331043538775 |
10 | 105012000113 |
11 | 40598599a59 |
12 | 18428381495 |
13 | 9b96cb0397 |
14 | 51229674ad |
15 | 2ae9261a78 |
hex | 187333f571 |
105012000113 has 4 divisors (see below), whose sum is σ = 105619006068. Its totient is φ = 104404994160.
The previous prime is 105012000097. The next prime is 105012000157. The reversal of 105012000113 is 311000210501.
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 37707037489 + 67304962624 = 194183^2 + 259432^2 .
It is a cyclic number.
It is not a de Polignac number, because 105012000113 - 24 = 105012000097 is a prime.
It is a super-2 number, since 2×1050120001132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105012000173) 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, 303502718 + ... + 303503063.
It is an arithmetic number, because the mean of its divisors is an integer number (26404751517).
Almost surely, 2105012000113 is an apocalyptic number.
It is an amenable number.
105012000113 is a deficient number, since it is larger than the sum of its proper divisors (607005955).
105012000113 is an equidigital number, since it uses as much as digits as its factorization.
105012000113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607005954.
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 105012000113 its reverse (311000210501), we get a palindrome (416012210614).
The spelling of 105012000113 in words is "one hundred five billion, twelve million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •