Base | Representation |
---|---|
bin | 1100101110001… |
… | …00111111010001 |
3 | 21102210120202212 |
4 | 12113010333101 |
5 | 204304304131 |
6 | 14331121505 |
7 | 2434021511 |
oct | 627047721 |
9 | 242716685 |
10 | 106713041 |
11 | 552670a6 |
12 | 2b8a3295 |
13 | 19154216 |
14 | 1025b841 |
15 | 957da2b |
hex | 65c4fd1 |
106713041 has 2 divisors, whose sum is σ = 106713042. Its totient is φ = 106713040.
The previous prime is 106713001. The next prime is 106713043. The reversal of 106713041 is 140317601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72607441 + 34105600 = 8521^2 + 5840^2 .
It is a cyclic number.
It is not a de Polignac number, because 106713041 - 214 = 106696657 is a prime.
It is a super-2 number, since 2×1067130412 = 22775346238935362, which contains 22 as substring.
Together with 106713043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 106712998 and 106713016.
It is not a weakly prime, because it can be changed into another prime (106713043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53356520 + 53356521.
It is an arithmetic number, because the mean of its divisors is an integer number (53356521).
Almost surely, 2106713041 is an apocalyptic number.
It is an amenable number.
106713041 is a deficient number, since it is larger than the sum of its proper divisors (1).
106713041 is an equidigital number, since it uses as much as digits as its factorization.
106713041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
The square root of 106713041 is about 10330.2004336799. The cubic root of 106713041 is about 474.3211592058.
The spelling of 106713041 in words is "one hundred six million, seven hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •