Base | Representation |
---|---|
bin | 1100100001011… |
… | …11001111101001 |
3 | 21022200011000222 |
4 | 12100233033221 |
5 | 203343113423 |
6 | 14231335425 |
7 | 2413630316 |
oct | 620571751 |
9 | 238604028 |
10 | 105051113 |
11 | 54331502 |
12 | 2b221575 |
13 | 189c192b |
14 | dd47d0d |
15 | 93513c8 |
hex | 642f3e9 |
105051113 has 2 divisors, whose sum is σ = 105051114. Its totient is φ = 105051112.
The previous prime is 105051101. The next prime is 105051151. The reversal of 105051113 is 311150501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69672409 + 35378704 = 8347^2 + 5948^2 .
It is a cyclic number.
It is not a de Polignac number, because 105051113 - 26 = 105051049 is a prime.
It is a super-2 number, since 2×1050511132 = 22071472685077538, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 105051091 and 105051100.
It is not a weakly prime, because it can be changed into another prime (105051013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52525556 + 52525557.
It is an arithmetic number, because the mean of its divisors is an integer number (52525557).
Almost surely, 2105051113 is an apocalyptic number.
It is an amenable number.
105051113 is a deficient number, since it is larger than the sum of its proper divisors (1).
105051113 is an equidigital number, since it uses as much as digits as its factorization.
105051113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75, while the sum is 17.
The square root of 105051113 is about 10249.4445215338. Note that the first 3 decimals coincide. The cubic root of 105051113 is about 471.8459365636.
The spelling of 105051113 in words is "one hundred five million, fifty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •